./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 791161d1 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-?-791161d [2022-07-23 05:25:33,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:25:33,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:25:33,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:25:33,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:25:33,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:25:33,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:25:33,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:25:33,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:25:33,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:25:33,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:25:33,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:25:33,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:25:33,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:25:33,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:25:33,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:25:33,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:25:33,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:25:33,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:25:33,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:25:33,061 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:25:33,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:25:33,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:25:33,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:25:33,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:25:33,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:25:33,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:25:33,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:25:33,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:25:33,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:25:33,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:25:33,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:25:33,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:25:33,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:25:33,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:25:33,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:25:33,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:25:33,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:25:33,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:25:33,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:25:33,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:25:33,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:25:33,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-23 05:25:33,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:25:33,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:25:33,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:25:33,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:25:33,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:25:33,088 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:25:33,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:25:33,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:25:33,089 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:25:33,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:25:33,089 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:25:33,090 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:25:33,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:25:33,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:25:33,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:25:33,090 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:25:33,090 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:25:33,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:25:33,091 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:25:33,091 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:25:33,091 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:25:33,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:25:33,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:25:33,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:25:33,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:25:33,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:25:33,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:25:33,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:25:33,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:25:33,092 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-23 05:25:33,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:25:33,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:25:33,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:25:33,327 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:25:33,327 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:25:33,328 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-23 05:25:33,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e37b17ec/cbd36a5b910440ada7d6666a6e49f23a/FLAG0f66455f9 [2022-07-23 05:25:33,731 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:25:33,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2022-07-23 05:25:33,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e37b17ec/cbd36a5b910440ada7d6666a6e49f23a/FLAG0f66455f9 [2022-07-23 05:25:34,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e37b17ec/cbd36a5b910440ada7d6666a6e49f23a [2022-07-23 05:25:34,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:25:34,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:25:34,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:25:34,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:25:34,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:25:34,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6427eb50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34, skipping insertion in model container [2022-07-23 05:25:34,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:25:34,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:25:34,351 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-23 05:25:34,356 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-23 05:25:34,357 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-23 05:25:34,376 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-23 05:25:34,379 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-23 05:25:34,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:25:34,390 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:25:34,416 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-23 05:25:34,417 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-23 05:25:34,418 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-23 05:25:34,423 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-23 05:25:34,424 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-23 05:25:34,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:25:34,443 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:25:34,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34 WrapperNode [2022-07-23 05:25:34,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:25:34,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:25:34,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:25:34,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:25:34,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,479 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2022-07-23 05:25:34,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:25:34,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:25:34,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:25:34,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:25:34,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:25:34,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:25:34,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:25:34,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:25:34,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (1/1) ... [2022-07-23 05:25:34,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:25:34,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:34,539 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-23 05:25:34,541 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-23 05:25:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 05:25:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 05:25:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 05:25:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 05:25:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:25:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:25:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:25:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 05:25:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:25:34,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:25:34,652 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:25:34,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:25:34,958 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:25:34,963 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:25:34,963 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-07-23 05:25:34,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:25:34 BoogieIcfgContainer [2022-07-23 05:25:34,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:25:34,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:25:34,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:25:34,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:25:34,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:25:34" (1/3) ... [2022-07-23 05:25:34,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79796f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:25:34, skipping insertion in model container [2022-07-23 05:25:34,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:34" (2/3) ... [2022-07-23 05:25:34,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79796f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:25:34, skipping insertion in model container [2022-07-23 05:25:34,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:25:34" (3/3) ... [2022-07-23 05:25:34,973 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2022-07-23 05:25:34,983 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:25:34,983 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-07-23 05:25:35,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:25:35,043 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@34d20407, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fc44eac [2022-07-23 05:25:35,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-07-23 05:25:35,047 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-23 05:25:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:25:35,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:35,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:25:35,055 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-23 05:25:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 05:25:35,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:35,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498023953] [2022-07-23 05:25:35,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:35,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:35,206 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-23 05:25:35,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:35,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498023953] [2022-07-23 05:25:35,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498023953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:35,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:35,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:25:35,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606290475] [2022-07-23 05:25:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:35,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:35,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:35,243 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-23 05:25:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:35,398 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2022-07-23 05:25:35,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:35,400 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-23 05:25:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:35,409 INFO L225 Difference]: With dead ends: 190 [2022-07-23 05:25:35,409 INFO L226 Difference]: Without dead ends: 186 [2022-07-23 05:25:35,411 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-23 05:25:35,415 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-23 05:25:35,416 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-23 05:25:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-23 05:25:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 149. [2022-07-23 05:25:35,455 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-23 05:25:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2022-07-23 05:25:35,464 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2022-07-23 05:25:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:35,464 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2022-07-23 05:25:35,465 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-23 05:25:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2022-07-23 05:25:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:25:35,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:35,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:25:35,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:25:35,467 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-23 05:25:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:35,468 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 05:25:35,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:35,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747996350] [2022-07-23 05:25:35,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:35,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:35,517 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-23 05:25:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:35,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747996350] [2022-07-23 05:25:35,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747996350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:35,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:35,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:25:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617616259] [2022-07-23 05:25:35,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:35,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:35,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:35,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:35,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:35,524 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-23 05:25:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:35,619 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2022-07-23 05:25:35,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:35,620 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-23 05:25:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:35,623 INFO L225 Difference]: With dead ends: 185 [2022-07-23 05:25:35,623 INFO L226 Difference]: Without dead ends: 185 [2022-07-23 05:25:35,623 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-23 05:25:35,624 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-23 05:25:35,625 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-23 05:25:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-23 05:25:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2022-07-23 05:25:35,642 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-23 05:25:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2022-07-23 05:25:35,643 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 3 [2022-07-23 05:25:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:35,643 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2022-07-23 05:25:35,643 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-23 05:25:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2022-07-23 05:25:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:25:35,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:35,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:35,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:25:35,645 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-23 05:25:35,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924362, now seen corresponding path program 1 times [2022-07-23 05:25:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:35,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898148939] [2022-07-23 05:25:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:35,706 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-23 05:25:35,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:35,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898148939] [2022-07-23 05:25:35,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898148939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:35,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:35,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:25:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248629725] [2022-07-23 05:25:35,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:35,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:35,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:35,711 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-23 05:25:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:35,908 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2022-07-23 05:25:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:25:35,909 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-23 05:25:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:35,911 INFO L225 Difference]: With dead ends: 151 [2022-07-23 05:25:35,911 INFO L226 Difference]: Without dead ends: 151 [2022-07-23 05:25:35,911 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-23 05:25:35,919 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-23 05:25:35,920 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-23 05:25:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-23 05:25:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2022-07-23 05:25:35,929 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-23 05:25:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2022-07-23 05:25:35,930 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 10 [2022-07-23 05:25:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:35,930 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2022-07-23 05:25:35,930 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-23 05:25:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2022-07-23 05:25:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:25:35,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:35,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:35,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:25:35,931 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-23 05:25:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924363, now seen corresponding path program 1 times [2022-07-23 05:25:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:35,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416169076] [2022-07-23 05:25:35,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:36,008 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-23 05:25:36,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:36,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416169076] [2022-07-23 05:25:36,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416169076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:36,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:36,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:25:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87503879] [2022-07-23 05:25:36,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:36,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:36,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:36,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:36,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:36,010 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-23 05:25:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:36,177 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2022-07-23 05:25:36,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:25:36,178 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-23 05:25:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:36,178 INFO L225 Difference]: With dead ends: 139 [2022-07-23 05:25:36,179 INFO L226 Difference]: Without dead ends: 139 [2022-07-23 05:25:36,179 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-23 05:25:36,179 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-23 05:25:36,180 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-23 05:25:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-23 05:25:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-07-23 05:25:36,183 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-23 05:25:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2022-07-23 05:25:36,184 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 10 [2022-07-23 05:25:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:36,184 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2022-07-23 05:25:36,184 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-23 05:25:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2022-07-23 05:25:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:25:36,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:36,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:36,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:25:36,185 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-23 05:25:36,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:36,186 INFO L85 PathProgramCache]: Analyzing trace with hash 592229104, now seen corresponding path program 1 times [2022-07-23 05:25:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:36,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796905177] [2022-07-23 05:25:36,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:36,239 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-23 05:25:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:36,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796905177] [2022-07-23 05:25:36,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796905177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:36,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:36,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:25:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530980854] [2022-07-23 05:25:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:36,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:36,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:36,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:36,242 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-23 05:25:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:36,393 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-07-23 05:25:36,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:25:36,394 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-23 05:25:36,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:36,395 INFO L225 Difference]: With dead ends: 146 [2022-07-23 05:25:36,395 INFO L226 Difference]: Without dead ends: 146 [2022-07-23 05:25:36,395 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-23 05:25:36,395 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-23 05:25:36,395 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-23 05:25:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-23 05:25:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2022-07-23 05:25:36,398 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-23 05:25:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2022-07-23 05:25:36,398 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 17 [2022-07-23 05:25:36,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:36,398 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2022-07-23 05:25:36,398 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-23 05:25:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2022-07-23 05:25:36,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:25:36,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:36,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:36,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:25:36,399 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-23 05:25:36,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 592229105, now seen corresponding path program 1 times [2022-07-23 05:25:36,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:36,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072024490] [2022-07-23 05:25:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:36,478 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-23 05:25:36,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:36,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072024490] [2022-07-23 05:25:36,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072024490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:36,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:36,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:25:36,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950149545] [2022-07-23 05:25:36,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:36,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:36,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:36,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:36,480 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-23 05:25:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:36,618 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2022-07-23 05:25:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:25:36,619 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-23 05:25:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:36,625 INFO L225 Difference]: With dead ends: 138 [2022-07-23 05:25:36,625 INFO L226 Difference]: Without dead ends: 138 [2022-07-23 05:25:36,626 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-23 05:25:36,631 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-23 05:25:36,631 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-23 05:25:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-23 05:25:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2022-07-23 05:25:36,635 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-23 05:25:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-07-23 05:25:36,636 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 17 [2022-07-23 05:25:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:36,636 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-07-23 05:25:36,636 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-23 05:25:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-07-23 05:25:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 05:25:36,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:36,637 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-23 05:25:36,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 05:25:36,638 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-23 05:25:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash 840457529, now seen corresponding path program 1 times [2022-07-23 05:25:36,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:36,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838867478] [2022-07-23 05:25:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:36,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:36,697 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-23 05:25:36,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:36,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838867478] [2022-07-23 05:25:36,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838867478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:36,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:36,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:25:36,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54812705] [2022-07-23 05:25:36,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:36,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:36,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:36,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:36,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:36,700 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-23 05:25:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:36,763 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-07-23 05:25:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:36,764 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-23 05:25:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:36,765 INFO L225 Difference]: With dead ends: 141 [2022-07-23 05:25:36,765 INFO L226 Difference]: Without dead ends: 141 [2022-07-23 05:25:36,765 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-23 05:25:36,766 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:36,766 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.1s Time] [2022-07-23 05:25:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-23 05:25:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2022-07-23 05:25:36,768 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-23 05:25:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2022-07-23 05:25:36,768 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 23 [2022-07-23 05:25:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:36,769 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2022-07-23 05:25:36,769 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-23 05:25:36,769 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2022-07-23 05:25:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 05:25:36,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:36,769 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-23 05:25:36,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 05:25:36,770 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-23 05:25:36,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash 840457530, now seen corresponding path program 1 times [2022-07-23 05:25:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:36,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423505241] [2022-07-23 05:25:36,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:36,823 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-23 05:25:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:36,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423505241] [2022-07-23 05:25:36,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423505241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:36,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:36,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:25:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954498426] [2022-07-23 05:25:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:36,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:36,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:36,825 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-23 05:25:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:36,882 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-07-23 05:25:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:36,883 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-23 05:25:36,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:36,883 INFO L225 Difference]: With dead ends: 136 [2022-07-23 05:25:36,884 INFO L226 Difference]: Without dead ends: 136 [2022-07-23 05:25:36,884 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-23 05:25:36,884 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:36,884 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.1s Time] [2022-07-23 05:25:36,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-23 05:25:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2022-07-23 05:25:36,886 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-23 05:25:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2022-07-23 05:25:36,887 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 23 [2022-07-23 05:25:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:36,887 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2022-07-23 05:25:36,887 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-23 05:25:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2022-07-23 05:25:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 05:25:36,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:36,888 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-23 05:25:36,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:25:36,888 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-23 05:25:36,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash 225913191, now seen corresponding path program 1 times [2022-07-23 05:25:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:36,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143438203] [2022-07-23 05:25:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:36,950 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-23 05:25:36,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:36,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143438203] [2022-07-23 05:25:36,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143438203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:36,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:36,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:25:36,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561025988] [2022-07-23 05:25:36,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:36,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:25:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:36,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:25:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:25:36,954 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-23 05:25:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:37,075 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2022-07-23 05:25:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:25:37,075 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-23 05:25:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:37,076 INFO L225 Difference]: With dead ends: 175 [2022-07-23 05:25:37,076 INFO L226 Difference]: Without dead ends: 175 [2022-07-23 05:25:37,076 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-23 05:25:37,077 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-23 05:25:37,077 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-23 05:25:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-23 05:25:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-07-23 05:25:37,079 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-23 05:25:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2022-07-23 05:25:37,080 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 25 [2022-07-23 05:25:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:37,080 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2022-07-23 05:25:37,080 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-23 05:25:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2022-07-23 05:25:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 05:25:37,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:37,081 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-23 05:25:37,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 05:25:37,081 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-23 05:25:37,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash 225913192, now seen corresponding path program 1 times [2022-07-23 05:25:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:37,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86421836] [2022-07-23 05:25:37,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:37,194 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-23 05:25:37,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:37,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86421836] [2022-07-23 05:25:37,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86421836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:37,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:37,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:25:37,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674328815] [2022-07-23 05:25:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:37,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:25:37,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:37,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:25:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:25:37,196 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-23 05:25:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:37,421 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2022-07-23 05:25:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:25:37,422 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-23 05:25:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:37,423 INFO L225 Difference]: With dead ends: 226 [2022-07-23 05:25:37,423 INFO L226 Difference]: Without dead ends: 226 [2022-07-23 05:25:37,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:25:37,424 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 255 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-23 05:25:37,424 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-23 05:25:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-23 05:25:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 170. [2022-07-23 05:25:37,427 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-23 05:25:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2022-07-23 05:25:37,427 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 25 [2022-07-23 05:25:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:37,428 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2022-07-23 05:25:37,428 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-23 05:25:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2022-07-23 05:25:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:25:37,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:37,428 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-23 05:25:37,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 05:25:37,428 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-23 05:25:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1586624732, now seen corresponding path program 1 times [2022-07-23 05:25:37,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:37,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010040102] [2022-07-23 05:25:37,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:37,469 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-23 05:25:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:37,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010040102] [2022-07-23 05:25:37,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010040102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:37,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:37,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:25:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653888917] [2022-07-23 05:25:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:37,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:25:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:25:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:25:37,472 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-23 05:25:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:37,544 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2022-07-23 05:25:37,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:25:37,544 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-23 05:25:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:37,545 INFO L225 Difference]: With dead ends: 210 [2022-07-23 05:25:37,545 INFO L226 Difference]: Without dead ends: 210 [2022-07-23 05:25:37,545 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-23 05:25:37,547 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-23 05:25:37,547 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-23 05:25:37,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-23 05:25:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2022-07-23 05:25:37,550 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-23 05:25:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 205 transitions. [2022-07-23 05:25:37,551 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 205 transitions. Word has length 26 [2022-07-23 05:25:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:37,551 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 205 transitions. [2022-07-23 05:25:37,551 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-23 05:25:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 205 transitions. [2022-07-23 05:25:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 05:25:37,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:37,557 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-23 05:25:37,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 05:25:37,557 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-23 05:25:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1044883735, now seen corresponding path program 1 times [2022-07-23 05:25:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:37,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528218212] [2022-07-23 05:25:37,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:37,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:37,831 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-23 05:25:37,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:37,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528218212] [2022-07-23 05:25:37,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528218212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:37,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:37,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-23 05:25:37,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055884533] [2022-07-23 05:25:37,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:37,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 05:25:37,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:37,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 05:25:37,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-07-23 05:25:37,834 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-23 05:25:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:38,425 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-07-23 05:25:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 05:25:38,425 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-23 05:25:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:38,426 INFO L225 Difference]: With dead ends: 198 [2022-07-23 05:25:38,426 INFO L226 Difference]: Without dead ends: 198 [2022-07-23 05:25:38,426 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-23 05:25:38,427 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:38,427 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.3s Time] [2022-07-23 05:25:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-23 05:25:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2022-07-23 05:25:38,429 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-23 05:25:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2022-07-23 05:25:38,430 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 29 [2022-07-23 05:25:38,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:38,430 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2022-07-23 05:25:38,430 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-23 05:25:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2022-07-23 05:25:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 05:25:38,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:38,430 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-23 05:25:38,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 05:25:38,430 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-23 05:25:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash 981328753, now seen corresponding path program 1 times [2022-07-23 05:25:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:38,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315198694] [2022-07-23 05:25:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:38,461 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-23 05:25:38,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:38,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315198694] [2022-07-23 05:25:38,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315198694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:38,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:38,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:25:38,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910069411] [2022-07-23 05:25:38,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:38,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:38,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:38,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:38,463 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-23 05:25:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:38,476 INFO L93 Difference]: Finished difference Result 172 states and 207 transitions. [2022-07-23 05:25:38,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:38,477 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-23 05:25:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:38,477 INFO L225 Difference]: With dead ends: 172 [2022-07-23 05:25:38,478 INFO L226 Difference]: Without dead ends: 172 [2022-07-23 05:25:38,478 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-23 05:25:38,478 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-23 05:25:38,479 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-23 05:25:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-23 05:25:38,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-07-23 05:25:38,481 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-23 05:25:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2022-07-23 05:25:38,481 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 31 [2022-07-23 05:25:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:38,482 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2022-07-23 05:25:38,482 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-23 05:25:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2022-07-23 05:25:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 05:25:38,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:38,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 05:25:38,483 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-23 05:25:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash 873646240, now seen corresponding path program 1 times [2022-07-23 05:25:38,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:38,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992474743] [2022-07-23 05:25:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:38,519 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-23 05:25:38,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:38,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992474743] [2022-07-23 05:25:38,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992474743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:38,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:38,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:25:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491396747] [2022-07-23 05:25:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:38,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:25:38,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:38,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:25:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:25:38,521 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-23 05:25:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:38,585 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2022-07-23 05:25:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:25:38,586 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-23 05:25:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:38,587 INFO L225 Difference]: With dead ends: 209 [2022-07-23 05:25:38,587 INFO L226 Difference]: Without dead ends: 209 [2022-07-23 05:25:38,587 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-23 05:25:38,595 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-23 05:25:38,596 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-23 05:25:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-23 05:25:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2022-07-23 05:25:38,598 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-23 05:25:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2022-07-23 05:25:38,599 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 35 [2022-07-23 05:25:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:38,600 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2022-07-23 05:25:38,600 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-23 05:25:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2022-07-23 05:25:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 05:25:38,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:38,601 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-23 05:25:38,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 05:25:38,602 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-23 05:25:38,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:38,602 INFO L85 PathProgramCache]: Analyzing trace with hash 124937643, now seen corresponding path program 1 times [2022-07-23 05:25:38,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:38,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51427797] [2022-07-23 05:25:38,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:38,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:38,961 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-23 05:25:38,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:38,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51427797] [2022-07-23 05:25:38,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51427797] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:38,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084757547] [2022-07-23 05:25:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:38,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:38,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:38,964 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-23 05:25:38,975 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-23 05:25:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:39,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-23 05:25:39,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:39,180 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-23 05:25:39,200 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:25:39,201 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-23 05:25:39,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 05:25:39,248 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-23 05:25:39,257 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-23 05:25:39,276 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:25:39,277 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-23 05:25:39,308 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-23 05:25:39,441 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:25:39,442 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-23 05:25:39,476 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-23 05:25:39,551 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:25:39,551 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-23 05:25:39,600 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:25:39,600 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-23 05:25:39,616 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-23 05:25:39,674 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-23 05:25:39,674 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-23 05:25:39,712 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-23 05:25:39,744 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-23 05:25:39,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:39,809 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-23 05:25:39,854 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-23 05:25:39,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:40,030 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-23 05:25:40,067 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-23 05:25:40,107 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-23 05:25:40,120 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-23 05:25:40,192 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-23 05:25:40,207 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:40,207 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-23 05:25:40,225 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-23 05:25:40,277 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-23 05:25:40,297 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-23 05:25:40,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:40,329 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-23 05:25:40,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:40,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:40,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:40,340 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-23 05:25:40,347 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:40,348 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-23 05:25:40,426 INFO L356 Elim1Store]: treesize reduction 27, result has 77.7 percent of original size [2022-07-23 05:25:40,426 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-23 05:25:41,687 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-23 05:25:41,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084757547] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:41,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:41,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 42 [2022-07-23 05:25:41,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165483123] [2022-07-23 05:25:41,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:41,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-23 05:25:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-23 05:25:41,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1031, Unknown=10, NotChecked=584, Total=1806 [2022-07-23 05:25:41,691 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-23 05:25:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:42,720 INFO L93 Difference]: Finished difference Result 279 states and 314 transitions. [2022-07-23 05:25:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-23 05:25:42,720 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-23 05:25:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:42,721 INFO L225 Difference]: With dead ends: 279 [2022-07-23 05:25:42,721 INFO L226 Difference]: Without dead ends: 279 [2022-07-23 05:25:42,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=2496, Unknown=10, NotChecked=904, Total=3906 [2022-07-23 05:25:42,722 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 974 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-23 05:25:42,722 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-23 05:25:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-23 05:25:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 192. [2022-07-23 05:25:42,725 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-23 05:25:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2022-07-23 05:25:42,725 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 37 [2022-07-23 05:25:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:42,726 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2022-07-23 05:25:42,726 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-23 05:25:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2022-07-23 05:25:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 05:25:42,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:42,726 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-23 05:25:42,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 05:25:42,926 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-23 05:25:42,927 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-23 05:25:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash 124937644, now seen corresponding path program 1 times [2022-07-23 05:25:42,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:42,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463181506] [2022-07-23 05:25:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:42,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:43,342 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-23 05:25:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:43,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463181506] [2022-07-23 05:25:43,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463181506] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:43,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273810308] [2022-07-23 05:25:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:43,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:43,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:43,344 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-23 05:25:43,345 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-23 05:25:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:43,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-23 05:25:43,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:43,465 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-23 05:25:43,470 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-23 05:25:43,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:25:43,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, 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-23 05:25:43,504 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:25:43,504 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-23 05:25:43,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:25:43,530 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-23 05:25:43,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 05:25:43,564 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-23 05:25:43,620 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-23 05:25:43,629 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-23 05:25:43,642 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:25:43,643 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-23 05:25:43,699 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-23 05:25:43,707 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-23 05:25:43,753 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-23 05:25:43,817 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-23 05:25:43,825 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-23 05:25:43,838 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-23 05:25:43,897 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 05:25:43,898 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-23 05:25:43,925 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-23 05:25:43,940 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-23 05:25:44,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:44,058 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-23 05:25:44,113 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-23 05:25:44,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:25:44,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273810308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:44,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 05:25:44,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [17] total 34 [2022-07-23 05:25:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918582516] [2022-07-23 05:25:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:44,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 05:25:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:44,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 05:25:44,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2022-07-23 05:25:44,115 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-23 05:25:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:44,754 INFO L93 Difference]: Finished difference Result 204 states and 243 transitions. [2022-07-23 05:25:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:25:44,754 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-23 05:25:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:44,755 INFO L225 Difference]: With dead ends: 204 [2022-07-23 05:25:44,755 INFO L226 Difference]: Without dead ends: 203 [2022-07-23 05:25:44,755 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-23 05:25:44,756 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-23 05:25:44,756 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-23 05:25:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-23 05:25:44,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2022-07-23 05:25:44,759 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-23 05:25:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 239 transitions. [2022-07-23 05:25:44,759 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 239 transitions. Word has length 37 [2022-07-23 05:25:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:44,759 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 239 transitions. [2022-07-23 05:25:44,759 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-23 05:25:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 239 transitions. [2022-07-23 05:25:44,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 05:25:44,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:44,760 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-23 05:25:44,779 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-23 05:25:44,971 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-23 05:25:44,971 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-23 05:25:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:44,972 INFO L85 PathProgramCache]: Analyzing trace with hash -706370693, now seen corresponding path program 1 times [2022-07-23 05:25:44,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:44,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104592974] [2022-07-23 05:25:44,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:44,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:45,254 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-23 05:25:45,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:45,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104592974] [2022-07-23 05:25:45,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104592974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:45,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968786525] [2022-07-23 05:25:45,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:45,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:45,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:45,256 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-23 05:25:45,257 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-23 05:25:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:45,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 05:25:45,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:45,370 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-23 05:25:45,380 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:25:45,380 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-23 05:25:45,387 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-23 05:25:45,408 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-23 05:25:45,415 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-23 05:25:45,425 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:25:45,425 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-23 05:25:45,432 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-23 05:25:45,505 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:25:45,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 47 treesize of output 49 [2022-07-23 05:25:45,515 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-23 05:25:45,563 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:25:45,564 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-23 05:25:45,596 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:25:45,597 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-23 05:25:45,610 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-23 05:25:45,662 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 05:25:45,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, 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-23 05:25:45,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:45,765 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:45,765 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-23 05:25:45,777 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-23 05:25:45,779 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-23 05:25:45,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:45,950 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)))) (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) 1)))) is different from false [2022-07-23 05:25:45,990 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |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_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)))) (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) 1)))) is different from false [2022-07-23 05:25:46,004 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select |c_#valid| (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_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) 1))) (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (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_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|))))) is different from false [2022-07-23 05:25:46,026 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:46,027 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 65 treesize of output 69 [2022-07-23 05:25:46,075 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (or (= (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_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2) |c_ULTIMATE.start_main_~bcki~0#1.base|) (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| (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_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| (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_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (or (= (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_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2) |c_ULTIMATE.start_main_~bcki~0#1.base|) (not (<= v_prenex_2 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_2))))) is different from false [2022-07-23 05:25:46,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:46,195 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-23 05:25:46,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:46,211 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-23 05:25:46,219 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_1117 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_4) .cse0 v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_3) .cse1 v_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2) |c_ULTIMATE.start_main_~bcki~0#1.base|) (not (<= v_prenex_2 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_2)) (not (= (select |c_#valid| .cse1) 0)))))) is different from false [2022-07-23 05:25:46,253 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_1117 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_4) .cse0 v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (= |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_3) .cse1 v_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2)) (not (<= v_prenex_2 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_2)) (not (= (select |c_#valid| .cse1) 0)))))) is different from false [2022-07-23 05:25:46,270 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= v_prenex_2 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_2)) (not (= (select |c_#valid| .cse0) 0)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_3) .cse0 v_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_1117 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (let ((.cse2 (select v_arrayElimArr_4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (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_4) .cse2 v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse2) 0)))))) is different from false [2022-07-23 05:25:46,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:46,302 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 82 treesize of output 75 [2022-07-23 05:25:46,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:46,313 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 81 treesize of output 103 [2022-07-23 05:25:46,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:46,326 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 3 case distinctions, treesize of input 229 treesize of output 237 [2022-07-23 05:25:46,333 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 208 treesize of output 204 [2022-07-23 05:25:46,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:46,342 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 227 treesize of output 221 [2022-07-23 05:25:46,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 194 treesize of output 186 [2022-07-23 05:25:46,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:46,355 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 207 treesize of output 195 [2022-07-23 05:25:46,595 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-23 05:25:46,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968786525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:46,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:46,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 36 [2022-07-23 05:25:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252108530] [2022-07-23 05:25:46,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:46,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-23 05:25:46,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:46,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-23 05:25:46,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=765, Unknown=8, NotChecked=434, Total=1332 [2022-07-23 05:25:46,597 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-23 05:25:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:47,512 INFO L93 Difference]: Finished difference Result 220 states and 253 transitions. [2022-07-23 05:25:47,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 05:25:47,512 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-23 05:25:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:47,513 INFO L225 Difference]: With dead ends: 220 [2022-07-23 05:25:47,513 INFO L226 Difference]: Without dead ends: 220 [2022-07-23 05:25:47,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=1558, Unknown=9, NotChecked=616, Total=2450 [2022-07-23 05:25:47,514 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 226 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1488 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:47,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 994 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1026 Invalid, 0 Unknown, 1488 Unchecked, 0.4s Time] [2022-07-23 05:25:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-23 05:25:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210. [2022-07-23 05:25:47,517 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-23 05:25:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2022-07-23 05:25:47,518 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 38 [2022-07-23 05:25:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:47,518 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2022-07-23 05:25:47,518 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-23 05:25:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2022-07-23 05:25:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 05:25:47,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:47,518 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-23 05:25:47,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 05:25:47,723 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-23 05:25:47,724 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-23 05:25:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash -706370692, now seen corresponding path program 1 times [2022-07-23 05:25:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:47,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451138296] [2022-07-23 05:25:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:47,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:47,994 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-23 05:25:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:47,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451138296] [2022-07-23 05:25:47,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451138296] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:47,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238807000] [2022-07-23 05:25:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:47,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:47,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:47,996 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-23 05:25:47,997 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-23 05:25:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:48,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-23 05:25:48,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:48,109 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-23 05:25:48,133 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:25:48,134 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-23 05:25:48,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-23 05:25:48,169 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-23 05:25:48,262 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:48,263 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-23 05:25:48,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:25:48,281 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-23 05:25:48,325 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:48,326 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-23 05:25:48,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:25:48,335 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-23 05:25:48,356 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:48,357 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-23 05:25:48,371 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-23 05:25:48,371 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-23 05:25:48,419 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 05:25:48,420 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-23 05:25:48,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:25:48,430 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-23 05:25:48,584 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:25:48,584 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-23 05:25:48,603 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:48,603 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-23 05:25:48,607 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-23 05:25:48,646 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:25:48,647 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-23 05:25:48,664 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:48,664 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-23 05:25:48,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 5 treesize of output 3 [2022-07-23 05:25:48,718 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:25:48,719 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-23 05:25:48,724 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-23 05:25:48,919 INFO L356 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-07-23 05:25:48,919 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-23 05:25:48,971 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 05:25:48,972 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-23 05:25:49,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:49,127 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 05:25:49,127 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-23 05:25:49,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:49,131 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-23 05:25:49,175 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-23 05:25:49,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:49,365 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int Int))) (or (<= 0 (+ (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|) 4)) (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|)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int 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|)) (<= (+ (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|) 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|)))))) is different from false [2022-07-23 05:25:49,408 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int 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|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int 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|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4))))) is different from false [2022-07-23 05:25:49,422 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int 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|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_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)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int 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|)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))))))) is different from false [2022-07-23 05:25:49,617 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:49,617 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-23 05:25:49,701 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:49,701 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 142 treesize of output 146 [2022-07-23 05:25:49,766 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-23 05:25:49,817 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_118 Int)) (or (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_4) v_arrayElimCell_118 v_prenex_6) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5) 4) (not (= 0 (select |c_#valid| v_arrayElimCell_118))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_5 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_1274 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_6) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5))))) (not (= (select |c_#valid| (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|)) 0)))) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_ArrVal_1267 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| 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|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1267) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_5 Int)) (or (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (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_6) (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5) |c_ULTIMATE.start_main_~bcki~0#1.base|)) (not (= (select |c_#valid| (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|)) 0)))) (not (<= 0 v_prenex_5))))))) is different from false [2022-07-23 05:25:49,859 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1267 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1267) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1273) |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 (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_5 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (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_6) (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5))) (not (= (select |c_#valid| (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|)) 0)))) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)))))) (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_118 Int)) (or (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_4) v_arrayElimCell_118 v_prenex_6) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5) 4) (not (<= 0 v_prenex_5)) (not (= 0 (select |c_#valid| v_arrayElimCell_118))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_5 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_1274 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_6 |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_6) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5))))) (not (= (select |c_#valid| (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|)) 0)))) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5))))))) is different from false [2022-07-23 05:25:49,916 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_5 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_1274 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse0 (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_6) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5))))) (not (= (select |c_#valid| (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|)) 0)))) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_5 Int)) (or (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (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|))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_6) (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5)))) (not (= (select |c_#valid| (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|)) 0)))) (not (<= 0 v_prenex_5)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_ArrVal_1267 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| 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|)) (<= 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_ArrVal_1267) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0)))) (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_118 Int)) (or (<= (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_4) v_arrayElimCell_118 v_prenex_6) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5) 4) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)) (not (= 0 (select |c_#valid| v_arrayElimCell_118)))))) is different from false [2022-07-23 05:25:49,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:49,976 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-23 05:25:49,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:49,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:49,982 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-23 05:25:49,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:49,988 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-23 05:25:50,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:50,004 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 21 treesize of output 22 [2022-07-23 05:25:50,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:50,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:50,010 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-23 05:25:50,013 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-23 05:25:50,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:50,029 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-23 05:25:50,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:50,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:50,036 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 37 treesize of output 37 [2022-07-23 05:25:50,042 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:50,043 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 33 treesize of output 33 [2022-07-23 05:25:50,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:50,078 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-23 05:25:50,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:50,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:50,084 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-23 05:25:50,087 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-23 05:25:50,269 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-23 05:25:50,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238807000] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:50,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:50,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 44 [2022-07-23 05:25:50,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605782871] [2022-07-23 05:25:50,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:50,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-23 05:25:50,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:50,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-23 05:25:50,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1319, Unknown=8, NotChecked=474, Total=1980 [2022-07-23 05:25:50,271 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 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-23 05:25:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:51,216 INFO L93 Difference]: Finished difference Result 260 states and 296 transitions. [2022-07-23 05:25:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 05:25:51,216 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 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-23 05:25:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:51,217 INFO L225 Difference]: With dead ends: 260 [2022-07-23 05:25:51,217 INFO L226 Difference]: Without dead ends: 260 [2022-07-23 05:25:51,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=349, Invalid=2317, Unknown=10, NotChecked=630, Total=3306 [2022-07-23 05:25:51,218 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 214 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1553 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:51,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1169 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 546 Invalid, 0 Unknown, 1553 Unchecked, 0.3s Time] [2022-07-23 05:25:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-23 05:25:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 233. [2022-07-23 05:25:51,221 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-23 05:25:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 288 transitions. [2022-07-23 05:25:51,222 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 288 transitions. Word has length 38 [2022-07-23 05:25:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:51,222 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 288 transitions. [2022-07-23 05:25:51,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 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-23 05:25:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 288 transitions. [2022-07-23 05:25:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 05:25:51,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:51,223 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-23 05:25:51,250 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-23 05:25:51,439 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-23 05:25:51,440 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-23 05:25:51,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash 448725100, now seen corresponding path program 1 times [2022-07-23 05:25:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:51,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090068992] [2022-07-23 05:25:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:51,823 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-23 05:25:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:51,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090068992] [2022-07-23 05:25:51,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090068992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:51,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758065228] [2022-07-23 05:25:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:51,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:51,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:51,824 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-23 05:25:51,825 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-23 05:25:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:51,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-23 05:25:51,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:51,950 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-23 05:25:51,965 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:25:51,965 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-23 05:25:51,992 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-23 05:25:51,996 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-23 05:25:52,115 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:52,116 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-23 05:25:52,122 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-23 05:25:52,133 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:52,133 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-23 05:25:52,194 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:52,194 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-23 05:25:52,199 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-23 05:25:52,207 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:52,208 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-23 05:25:52,237 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-23 05:25:52,238 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-23 05:25:52,247 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-23 05:25:52,297 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 05:25:52,297 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-23 05:25:52,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, 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-23 05:25:52,477 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:25:52,477 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-23 05:25:52,501 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:52,502 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-23 05:25:52,505 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-23 05:25:52,554 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:25:52,554 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-23 05:25:52,584 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:52,585 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-23 05:25:52,590 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-23 05:25:52,635 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:25:52,635 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-23 05:25:52,641 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-23 05:25:52,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:25:52,728 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-23 05:25:52,753 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-23 05:25:52,754 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-23 05:25:52,802 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-23 05:25:52,813 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 05:25:52,813 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-23 05:25:52,894 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 05:25:52,894 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-23 05:25:52,897 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-23 05:25:53,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:53,062 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 05:25:53,062 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-23 05:25:53,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:53,066 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-23 05:25:53,071 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-23 05:25:53,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:53,228 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (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|)) (<= 0 (+ 8 (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|))))) (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|)) (<= (+ 12 (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|)) (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|))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))))) is different from false [2022-07-23 05:25:53,652 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (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|)) (<= 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 (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (or (<= (+ (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|))) (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 (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0))))) is different from false [2022-07-23 05:25:53,710 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 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|)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#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_#t~mem5#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|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (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|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#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 (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0))))) is different from false [2022-07-23 05:25:53,743 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (Array Int Int))) (or (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_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|))) (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 (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 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 |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 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|)) (select (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1448) (select (select (store (store |c_#memory_$Pointer$.base| .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|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0))))) is different from false [2022-07-23 05:25:54,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,008 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-23 05:25:54,217 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,217 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 320 treesize of output 324 [2022-07-23 05:25:54,313 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-23 05:25:54,418 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select (store |c_#valid| .cse0 1) |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (= (select |c_#valid| .cse0) 0)) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (let ((.cse1 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse1 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_11) .cse1 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10))))) (not (= (select (store |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 1) v_prenex_8) 0))))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|) 0)) (not (= (select .cse2 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1441) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 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))))) (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimCell_174 Int) (v_prenex_12 (Array Int Int)) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse3 (store |c_#valid| v_arrayElimCell_174 1))) (or (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_11) v_arrayElimCell_174 v_prenex_9) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) 0) (not (<= 0 v_prenex_10)) (not (= (select .cse3 v_prenex_8) 0)) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse3 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (= (select |c_#valid| v_arrayElimCell_174) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_prenex_8 Int)) (or (not (= (select (store |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 1) v_prenex_8) 0)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= |c_ULTIMATE.start_main_~bcki~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_11) (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10))))) (not (= (select (store |c_#valid| .cse4 1) |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (= (select |c_#valid| .cse4) 0))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_prenex_8 Int)) (or (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_11) (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) v_prenex_8))) (not (= (select (store |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 1) v_prenex_8) 0)))) (not (= (select (store |c_#valid| .cse5 1) |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (= (select |c_#valid| .cse5) 0))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|))))) is different from false [2022-07-23 05:25:54,518 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select (store |c_#valid| .cse0 1) |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select |c_#valid| .cse0) 0)) (forall ((v_prenex_8 Int)) (or (not (= (select (store |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 1) v_prenex_8) 0)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (let ((.cse1 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse1 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_11) .cse1 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10)))))))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)) (not (= (select .cse2 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1441) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 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|))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select (store |c_#valid| .cse3 1) |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select |c_#valid| .cse3) 0)) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= v_prenex_8 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_11) (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10)))) (not (= (select (store |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 1) v_prenex_8) 0))))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select (store |c_#valid| .cse4 1) |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select |c_#valid| .cse4) 0)) (forall ((v_prenex_8 Int)) (or (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_11) (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10))) (not (= (select (store |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 1) v_prenex_8) 0))))))))))) (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimCell_174 Int) (v_prenex_12 (Array Int Int)) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse5 (store |c_#valid| v_arrayElimCell_174 1))) (or (not (= (select .cse5 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (<= 0 v_prenex_10)) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_11) v_arrayElimCell_174 v_prenex_9) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) 0) (not (= (select .cse5 v_prenex_8) 0)) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| v_arrayElimCell_174) 0)))))) is different from false [2022-07-23 05:25:54,605 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 1)) (.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 (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|) 0)) (not (= (select .cse0 .cse1) 1)) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1441) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 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|)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select (store |c_#valid| .cse2 1) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 1)) (forall ((v_prenex_8 Int)) (or (not (= (select (store |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 1) v_prenex_8) 0)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (let ((.cse3 (select v_arrayElimArr_11 |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_11) .cse3 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10))))))) (not (= (select |c_#valid| .cse2) 0))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select (store |c_#valid| .cse4 1) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 1)) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse5 (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| .cse5 v_arrayElimArr_11) (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) .cse5))) (not (= (select (store |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 1) v_prenex_8) 0)))) (not (= (select |c_#valid| .cse4) 0))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimCell_174 Int) (v_prenex_12 (Array Int Int)) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse7 (store |c_#valid| v_arrayElimCell_174 1))) (or (not (<= 0 v_prenex_10)) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_prenex_11) v_arrayElimCell_174 v_prenex_9) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) 0) (not (= (select .cse7 .cse6) 1)) (not (= (select .cse7 v_prenex_8) 0)) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| v_arrayElimCell_174) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select (store |c_#valid| .cse8 1) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 1)) (forall ((v_prenex_8 Int)) (or (not (= (select (store |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 1) v_prenex_8) 0)) (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_11) (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) v_prenex_8))))) (not (= (select |c_#valid| .cse8) 0))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|))))) is different from false [2022-07-23 05:25:54,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,762 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-23 05:25:54,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:54,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:54,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,769 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-23 05:25:54,776 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,776 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 40 treesize of output 40 [2022-07-23 05:25:54,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,796 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-23 05:25:54,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:54,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:54,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,803 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-23 05:25:54,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,811 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 51 treesize of output 51 [2022-07-23 05:25:54,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,857 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 29 treesize of output 30 [2022-07-23 05:25:54,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:54,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:54,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,865 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 37 treesize of output 37 [2022-07-23 05:25:54,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,872 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 55 treesize of output 51 [2022-07-23 05:25:54,923 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,923 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-23 05:25:54,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:54,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:54,931 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,931 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-23 05:25:54,936 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-23 05:25:54,966 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,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, 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-23 05:25:54,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:54,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:54,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:54,973 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-23 05:25:54,979 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-23 05:25:55,234 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-23 05:25:55,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758065228] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:55,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:55,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 47 [2022-07-23 05:25:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072489321] [2022-07-23 05:25:55,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:55,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-23 05:25:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:55,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-23 05:25:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1432, Unknown=10, NotChecked=588, Total=2256 [2022-07-23 05:25:55,237 INFO L87 Difference]: Start difference. First operand 233 states and 288 transitions. Second operand has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-23 05:25:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:56,430 INFO L93 Difference]: Finished difference Result 288 states and 330 transitions. [2022-07-23 05:25:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 05:25:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-23 05:25:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:56,432 INFO L225 Difference]: With dead ends: 288 [2022-07-23 05:25:56,432 INFO L226 Difference]: Without dead ends: 288 [2022-07-23 05:25:56,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=417, Invalid=2461, Unknown=12, NotChecked=770, Total=3660 [2022-07-23 05:25:56,433 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 214 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1737 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:56,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1625 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 808 Invalid, 0 Unknown, 1737 Unchecked, 0.4s Time] [2022-07-23 05:25:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-23 05:25:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 247. [2022-07-23 05:25:56,436 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-23 05:25:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2022-07-23 05:25:56,436 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 38 [2022-07-23 05:25:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:56,436 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2022-07-23 05:25:56,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-23 05:25:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2022-07-23 05:25:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 05:25:56,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:56,437 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-23 05:25:56,457 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-23 05:25:56,643 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-23 05:25:56,643 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-23 05:25:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash -372876340, now seen corresponding path program 1 times [2022-07-23 05:25:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:56,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321293717] [2022-07-23 05:25:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:56,997 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-23 05:25:56,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:56,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321293717] [2022-07-23 05:25:56,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321293717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:56,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335625817] [2022-07-23 05:25:56,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:56,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:56,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:56,999 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-23 05:25:57,000 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-23 05:25:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:57,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-23 05:25:57,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:57,132 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-23 05:25:57,149 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:25:57,149 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-23 05:25:57,174 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-23 05:25:57,179 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-23 05:25:57,279 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:57,279 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-23 05:25:57,286 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-23 05:25:57,294 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:57,294 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-23 05:25:57,344 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:57,344 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-23 05:25:57,360 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-23 05:25:57,371 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:57,372 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-23 05:25:57,398 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-23 05:25:57,398 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-23 05:25:57,409 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-23 05:25:57,454 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:57,454 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-23 05:25:57,459 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-23 05:25:57,472 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 05:25:57,472 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-23 05:25:57,663 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:25:57,663 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-23 05:25:57,682 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:57,682 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-23 05:25:57,687 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-23 05:25:57,742 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:25:57,742 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-23 05:25:57,762 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:57,762 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-23 05:25:57,766 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-23 05:25:57,815 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:25:57,816 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-23 05:25:57,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-23 05:25:57,916 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-23 05:25:57,916 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-23 05:25:57,920 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-23 05:25:57,971 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 05:25:57,972 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-23 05:25:57,985 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-23 05:25:58,046 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 05:25:58,046 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-23 05:25:58,059 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-23 05:25:58,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:58,232 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 05:25:58,233 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-23 05:25:58,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:58,237 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-23 05:25:58,242 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-23 05:25:58,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:58,407 WARN L833 $PredicateComparison]: unable to prove that (and (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|)) (<= (+ (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|) 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|))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))) (forall ((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|)) (<= 0 (+ (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|) 8)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|))))) is different from false [2022-07-23 05:25:58,570 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (v_ArrVal_1622 Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (<= (+ 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|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (forall ((v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int)) (or (<= 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|))) (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|))))))) is different from false [2022-07-23 05:25:58,626 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int))) (or (forall ((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|)) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#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|))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (v_ArrVal_1622 Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#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_#t~mem5#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|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0))))) is different from false [2022-07-23 05:25:58,648 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (forall ((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|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_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_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)) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (v_ArrVal_1622 Int)) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 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|) 12) (select (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1622) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 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 (<= |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|))))))) is different from false [2022-07-23 05:25:58,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:58,948 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-23 05:25:59,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:59,105 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 589 treesize of output 576 [2022-07-23 05:25:59,219 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-23 05:25:59,412 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (store |c_#valid| .cse0 1))) (or (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_17) .cse0 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) |c_ULTIMATE.start_main_~bcki~0#1.base|) (not (= (select .cse1 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select .cse1 v_prenex_27) 0)))))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse3 (store |c_#valid| .cse2 1))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_17) .cse2 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) v_prenex_27)) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse3 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse2) 0)) (not (= (select .cse3 v_prenex_27) 0)))))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse4 (store |c_#valid| .cse5 1))) (or (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse4 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse5) 0)) (not (= (select .cse4 v_prenex_27) 0)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_17) .cse5 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) .cse5)))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_235 Int) (v_prenex_28 (Array Int Int))) (let ((.cse6 (store |c_#valid| v_arrayElimCell_235 1))) (or (not (= (select |c_#valid| v_arrayElimCell_235) 0)) (not (= (select .cse6 v_prenex_27) 0)) (not (= (select .cse6 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_24) v_arrayElimCell_235 v_prenex_28) v_prenex_27 v_prenex_25) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) 0) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26))))) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_18| Int)) (let ((.cse7 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse7 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1614) |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 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|))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (not (= (select .cse7 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)))))) is different from false [2022-07-23 05:25:59,488 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (store |c_#valid| .cse0 1))) (or (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= v_prenex_27 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_17) .cse0 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26))) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select .cse1 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select .cse1 v_prenex_27) 0)))))))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_235 Int) (v_prenex_28 (Array Int Int))) (let ((.cse2 (store |c_#valid| v_arrayElimCell_235 1))) (or (not (= (select |c_#valid| v_arrayElimCell_235) 0)) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_24) v_arrayElimCell_235 v_prenex_28) v_prenex_27 v_prenex_25) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) 0) (not (= (select .cse2 v_prenex_27) 0)) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse2 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (<= 0 v_prenex_26))))) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_18| Int)) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18|))) (not (= (select .cse3 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1614) |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 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)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (not (= (select .cse3 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse5 (store |c_#valid| .cse4 1))) (or (not (= .cse4 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_17) .cse4 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26))) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse4) 0)) (not (= (select .cse5 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select .cse5 v_prenex_27) 0)))))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse7 (store |c_#valid| .cse6 1))) (or (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= |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_17) .cse6 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse6) 0)) (not (= (select .cse7 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select .cse7 v_prenex_27) 0))))))))) is different from false [2022-07-23 05:25:59,569 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (store |c_#valid| .cse0 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select .cse1 .cse2) 1)) (not (= (select .cse1 v_prenex_27) 0)) (not (= .cse0 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_17) .cse0 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse5 (store |c_#valid| .cse4 1))) (or (not (= v_prenex_27 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_17) .cse4 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26))) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse4) 0)) (not (= (select .cse5 .cse3) 1)) (not (= (select .cse5 v_prenex_27) 0)))))))) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_18| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse6 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse6 .cse7) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1614) |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 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)) (not (= (select .cse6 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0))))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_235 Int) (v_prenex_28 (Array Int Int))) (let ((.cse8 (store |c_#valid| v_arrayElimCell_235 1)) (.cse9 (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 |c_#valid| v_arrayElimCell_235) 0)) (not (= (select .cse8 v_prenex_27) 0)) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_prenex_24) v_arrayElimCell_235 v_prenex_28) v_prenex_27 v_prenex_25) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) 0) (not (= (select .cse8 .cse9) 1))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse12 (store |c_#valid| .cse11 1))) (or (= .cse10 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse10 v_arrayElimArr_17) .cse11 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26)) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse11) 0)) (not (= (select .cse12 .cse10) 1)) (not (= (select .cse12 v_prenex_27) 0))))))))) is different from false [2022-07-23 05:25:59,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:59,681 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-23 05:25:59,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:59,689 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 550 treesize of output 538 [2022-07-23 05:25:59,697 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 526 treesize of output 494 [2022-07-23 05:25:59,706 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 494 treesize of output 486 [2022-07-23 05:25:59,711 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 486 treesize of output 470 [2022-07-23 05:25:59,855 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:59,856 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 29 treesize of output 30 [2022-07-23 05:25:59,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:59,863 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 647 treesize of output 635 [2022-07-23 05:25:59,874 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:59,874 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 653 treesize of output 519 [2022-07-23 05:25:59,880 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 486 treesize of output 454 [2022-07-23 05:25:59,895 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 454 treesize of output 438 [2022-07-23 05:26:00,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:00,010 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-23 05:26:00,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:00,018 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 974 treesize of output 946 [2022-07-23 05:26:00,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 934 treesize of output 902 [2022-07-23 05:26:00,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 902 treesize of output 886 [2022-07-23 05:26:00,051 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 886 treesize of output 822 [2022-07-23 05:26:01,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:01,565 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-23 05:26:01,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:01,573 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 2223 treesize of output 2163 [2022-07-23 05:26:01,592 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 2150 treesize of output 2086 [2022-07-23 05:26:01,603 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 2086 treesize of output 1958 [2022-07-23 05:26:01,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:01,646 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 1989 treesize of output 1815 [2022-07-23 05:26:01,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:01,787 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-23 05:26:01,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:01,798 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 128 treesize of output 128 [2022-07-23 05:26:01,807 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 116 treesize of output 108 [2022-07-23 05:26:01,811 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 108 treesize of output 104 [2022-07-23 05:26:01,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:01,818 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 134 treesize of output 126 [2022-07-23 05:26:02,270 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-23 05:26:02,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335625817] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:02,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:26:02,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 47 [2022-07-23 05:26:02,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728927949] [2022-07-23 05:26:02,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:02,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-23 05:26:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:02,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-23 05:26:02,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1427, Unknown=10, NotChecked=588, Total=2256 [2022-07-23 05:26:02,272 INFO L87 Difference]: Start difference. First operand 247 states and 304 transitions. Second operand has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-23 05:26:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:03,190 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2022-07-23 05:26:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:26:03,190 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-23 05:26:03,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:03,191 INFO L225 Difference]: With dead ends: 265 [2022-07-23 05:26:03,191 INFO L226 Difference]: Without dead ends: 265 [2022-07-23 05:26:03,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=364, Invalid=2202, Unknown=12, NotChecked=728, Total=3306 [2022-07-23 05:26:03,192 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 158 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1051 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:03,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1387 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 1051 Unchecked, 0.2s Time] [2022-07-23 05:26:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-23 05:26:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2022-07-23 05:26:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.389908256880734) internal successors, (303), 246 states have internal predecessors, (303), 0 states have call successors, (0), 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-23 05:26:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 303 transitions. [2022-07-23 05:26:03,196 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 303 transitions. Word has length 38 [2022-07-23 05:26:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:03,196 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 303 transitions. [2022-07-23 05:26:03,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-23 05:26:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 303 transitions. [2022-07-23 05:26:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-23 05:26:03,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:03,197 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-23 05:26:03,221 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-23 05:26:03,403 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-23 05:26:03,404 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-23 05:26:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash -422654064, now seen corresponding path program 1 times [2022-07-23 05:26:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:03,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699417208] [2022-07-23 05:26:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:03,577 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-23 05:26:03,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:26:03,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699417208] [2022-07-23 05:26:03,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699417208] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:26:03,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721325410] [2022-07-23 05:26:03,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:03,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:26:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:26:03,580 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-23 05:26:03,581 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-23 05:26:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:03,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-23 05:26:03,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:03,736 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-23 05:26:03,748 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:03,748 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-23 05:26:03,754 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-23 05:26:03,811 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:03,811 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-23 05:26:03,824 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:03,824 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-23 05:26:03,851 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:03,851 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-23 05:26:03,878 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 05:26:03,878 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-23 05:26:03,968 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:26:03,969 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-23 05:26:03,978 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-23 05:26:04,019 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:26:04,019 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-23 05:26:04,048 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:26:04,049 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-23 05:26:04,058 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-23 05:26:04,119 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 05:26:04,119 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-23 05:26:04,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:04,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:04,177 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-23 05:26:04,182 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-23 05:26:04,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:04,262 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-23 05:26:04,279 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-23 05:26:04,286 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-23 05:26:04,300 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-23 05:26:04,339 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:04,340 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-23 05:26:04,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_23 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_23 |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 |c_#valid| .cse0) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_23) .cse0 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-23 05:26:04,368 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_23 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_23 |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_23) .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-23 05:26:04,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_23 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_23 |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_23) .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-23 05:26:04,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:04,397 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-23 05:26:04,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:04,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:04,404 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-23 05:26:04,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:04,410 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-23 05:26:04,417 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:26:04,417 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-23 05:26:04,503 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-23 05:26:04,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721325410] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:04,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:26:04,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 38 [2022-07-23 05:26:04,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147207481] [2022-07-23 05:26:04,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:04,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-23 05:26:04,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:04,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-23 05:26:04,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=781, Unknown=7, NotChecked=448, Total=1406 [2022-07-23 05:26:04,505 INFO L87 Difference]: Start difference. First operand 247 states and 303 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-23 05:26:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:05,700 INFO L93 Difference]: Finished difference Result 258 states and 303 transitions. [2022-07-23 05:26:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 05:26:05,700 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-23 05:26:05,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:05,701 INFO L225 Difference]: With dead ends: 258 [2022-07-23 05:26:05,701 INFO L226 Difference]: Without dead ends: 258 [2022-07-23 05:26:05,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=317, Invalid=1510, Unknown=7, NotChecked=616, Total=2450 [2022-07-23 05:26:05,702 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 176 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1391 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:05,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 984 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 423 Invalid, 0 Unknown, 1391 Unchecked, 0.2s Time] [2022-07-23 05:26:05,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-23 05:26:05,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 247. [2022-07-23 05:26:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.385321100917431) internal successors, (302), 246 states have internal predecessors, (302), 0 states have call successors, (0), 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-23 05:26:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 302 transitions. [2022-07-23 05:26:05,706 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 302 transitions. Word has length 39 [2022-07-23 05:26:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:05,706 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 302 transitions. [2022-07-23 05:26:05,706 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-23 05:26:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 302 transitions. [2022-07-23 05:26:05,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 05:26:05,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:05,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:26:05,733 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-23 05:26:05,919 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-23 05:26:05,919 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-23 05:26:05,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1573558672, now seen corresponding path program 1 times [2022-07-23 05:26:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:05,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977062975] [2022-07-23 05:26:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:26:06,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:26:06,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977062975] [2022-07-23 05:26:06,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977062975] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:26:06,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862999076] [2022-07-23 05:26:06,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:06,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:26:06,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:26:06,198 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-23 05:26:06,199 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-23 05:26:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:06,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-23 05:26:06,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:06,354 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-23 05:26:06,366 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:06,366 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-23 05:26:06,384 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-23 05:26:06,395 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-23 05:26:06,420 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-23 05:26:06,467 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-23 05:26:06,477 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-23 05:26:06,492 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:26:06,492 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-23 05:26:06,520 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-23 05:26:06,525 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-23 05:26:06,571 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-23 05:26:06,625 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-23 05:26:06,631 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-23 05:26:06,643 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-23 05:26:06,698 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 05:26:06,698 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-23 05:26:06,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:26:06,734 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-23 05:26:06,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:06,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:06,782 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 15 treesize of output 10 [2022-07-23 05:26:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:26:06,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:06,875 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 8 treesize of output 6 [2022-07-23 05:26:06,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-23 05:26:07,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-23 05:26:07,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-23 05:26:07,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-23 05:26:07,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-23 05:26:07,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_24| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24| 1) |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1930) |v_ULTIMATE.start_main_#t~malloc4#1.base_24| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-23 05:26:07,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_24| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1930) |v_ULTIMATE.start_main_#t~malloc4#1.base_24| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24| 1) |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-23 05:26:07,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_24| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24| 1) |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (<= 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_1930) |v_ULTIMATE.start_main_#t~malloc4#1.base_24| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-23 05:26:07,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:07,161 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-23 05:26:07,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:07,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:07,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:07,170 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-23 05:26:07,174 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-23 05:26:07,187 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-23 05:26:07,187 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 22 treesize of output 22 [2022-07-23 05:26:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:26:07,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862999076] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:07,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:26:07,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 47 [2022-07-23 05:26:07,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499146580] [2022-07-23 05:26:07,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:07,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-23 05:26:07,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:07,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-23 05:26:07,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1365, Unknown=9, NotChecked=664, Total=2256 [2022-07-23 05:26:07,269 INFO L87 Difference]: Start difference. First operand 247 states and 302 transitions. Second operand has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:26:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:09,876 INFO L93 Difference]: Finished difference Result 786 states and 889 transitions. [2022-07-23 05:26:09,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-23 05:26:09,878 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-23 05:26:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:09,880 INFO L225 Difference]: With dead ends: 786 [2022-07-23 05:26:09,880 INFO L226 Difference]: Without dead ends: 786 [2022-07-23 05:26:09,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 2599 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1276, Invalid=7303, Unknown=9, NotChecked=1512, Total=10100 [2022-07-23 05:26:09,882 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 2171 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 7150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5005 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:09,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 1928 Invalid, 7150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1797 Invalid, 0 Unknown, 5005 Unchecked, 0.9s Time] [2022-07-23 05:26:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2022-07-23 05:26:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 275. [2022-07-23 05:26:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 246 states have (on average 1.3780487804878048) internal successors, (339), 274 states have internal predecessors, (339), 0 states have call successors, (0), 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-23 05:26:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 339 transitions. [2022-07-23 05:26:09,887 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 339 transitions. Word has length 41 [2022-07-23 05:26:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:09,887 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 339 transitions. [2022-07-23 05:26:09,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:26:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 339 transitions. [2022-07-23 05:26:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 05:26:09,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:09,888 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-23 05:26:09,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 05:26:10,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-23 05:26:10,105 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-23 05:26:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash -27982635, now seen corresponding path program 1 times [2022-07-23 05:26:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:10,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399152861] [2022-07-23 05:26:10,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:10,456 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-23 05:26:10,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:26:10,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399152861] [2022-07-23 05:26:10,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399152861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:10,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:10,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-23 05:26:10,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330183411] [2022-07-23 05:26:10,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:10,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-23 05:26:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:10,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 05:26:10,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-23 05:26:10,458 INFO L87 Difference]: Start difference. First operand 275 states and 339 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-23 05:26:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:11,176 INFO L93 Difference]: Finished difference Result 333 states and 398 transitions. [2022-07-23 05:26:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 05:26:11,176 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-23 05:26:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:11,177 INFO L225 Difference]: With dead ends: 333 [2022-07-23 05:26:11,177 INFO L226 Difference]: Without dead ends: 333 [2022-07-23 05:26:11,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 05:26:11,178 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 325 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:11,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 459 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:26:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-23 05:26:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 282. [2022-07-23 05:26:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 253 states have (on average 1.3675889328063242) internal successors, (346), 281 states have internal predecessors, (346), 0 states have call successors, (0), 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-23 05:26:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 346 transitions. [2022-07-23 05:26:11,182 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 346 transitions. Word has length 41 [2022-07-23 05:26:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:11,183 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 346 transitions. [2022-07-23 05:26:11,183 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-23 05:26:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 346 transitions. [2022-07-23 05:26:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 05:26:11,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:11,183 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-23 05:26:11,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 05:26:11,184 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-23 05:26:11,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:11,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1534306045, now seen corresponding path program 1 times [2022-07-23 05:26:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:11,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122704556] [2022-07-23 05:26:11,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:11,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:11,686 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-23 05:26:11,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:26:11,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122704556] [2022-07-23 05:26:11,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122704556] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:26:11,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054804173] [2022-07-23 05:26:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:11,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:26:11,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:26:11,688 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:26:11,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 05:26:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:11,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-23 05:26:11,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:11,847 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-23 05:26:11,863 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:26:11,863 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-23 05:26:11,890 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-23 05:26:11,896 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-23 05:26:11,984 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:26:11,985 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-23 05:26:11,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 11 treesize of output 7 [2022-07-23 05:26:11,999 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:11,999 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-23 05:26:12,036 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-23 05:26:12,036 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-23 05:26:12,046 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 28 treesize of output 23 [2022-07-23 05:26:12,097 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 05:26:12,097 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-23 05:26:12,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,142 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-23 05:26:12,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,155 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-23 05:26:12,273 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:26:12,274 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-23 05:26:12,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,278 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-23 05:26:12,301 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:26:12,302 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-23 05:26:12,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,306 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-23 05:26:12,327 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 05:26:12,327 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-23 05:26:12,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,329 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-23 05:26:12,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,447 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 05:26:12,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 40 [2022-07-23 05:26:12,470 INFO L356 Elim1Store]: treesize reduction 74, result has 30.2 percent of original size [2022-07-23 05:26:12,470 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-23 05:26:12,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:12,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:12,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:12,789 INFO L356 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2022-07-23 05:26:12,789 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-23 05:26:12,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:12,795 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:26:12,795 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-23 05:26:12,804 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-23 05:26:12,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:17,075 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_ArrVal_2180 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2177))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (store .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse1 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_87| 4) v_ArrVal_2180)) (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (forall ((v_ArrVal_2179 Int)) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2178))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (select (store .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse3 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_87| 4) v_ArrVal_2179)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (+ 4 (select .cse3 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|))))) 0))))) is different from false [2022-07-23 05:26:17,111 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_ArrVal_2179 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2178))) (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_87| 4) v_ArrVal_2179)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (+ (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (forall ((v_ArrVal_2180 Int)) (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2177))) (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_87| 4) v_ArrVal_2180)) (select .cse3 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|) 4)) 0))))) is different from false [2022-07-23 05:26:17,127 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_ArrVal_2179 Int)) (= (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2178))) (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_87| 4) v_ArrVal_2179)) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2177) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (+ (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|) 4))))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_ArrVal_2180 Int)) (= (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_2177))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (store .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse4 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_87| 4) v_ArrVal_2180)) (select .cse4 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2178) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|) 4))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|))))) is different from false [2022-07-23 05:26:17,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:17,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:17,595 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-23 05:26:17,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:17,604 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:17,604 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-23 05:26:17,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:17,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:17,629 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-23 05:26:17,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:17,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:17,638 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 67 treesize of output 74 [2022-07-23 05:26:18,092 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_26 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_89| Int) (v_ArrVal_2179 Int) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_27 |v_ULTIMATE.start_main_~bcki~0#1.offset_89|)) (.cse4 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_89| 4))) (or (= (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse2 v_arrayElimArr_26) .cse3 v_ArrVal_2178))) (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_87| 4) v_ArrVal_2179)) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_27) .cse3 v_ArrVal_2177) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (+ (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|) 4))))) 0) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) |v_ULTIMATE.start_main_~bcki~0#1.offset_89|) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse3) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_89|)) (not (= (select v_arrayElimArr_27 .cse4) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (not (= (select v_arrayElimArr_26 .cse4) 0))))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_89| Int) (v_arrayElimArr_28 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_arrayElimArr_29 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse9 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_89| 4)) (.cse8 (select v_arrayElimArr_28 |v_ULTIMATE.start_main_~bcki~0#1.offset_89|))) (or (= (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse7 v_arrayElimArr_28) .cse8 v_ArrVal_2177))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (store .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse6 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_87| 4) v_ArrVal_2180)) (select .cse6 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse7 v_arrayElimArr_29) .cse8 v_ArrVal_2178) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) 0) (not (= (select v_arrayElimArr_29 .cse9) 0)) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) |v_ULTIMATE.start_main_~bcki~0#1.offset_89|) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select v_arrayElimArr_28 .cse9) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_89|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (not (= (select |c_#valid| .cse8) 0)))))) is different from false [2022-07-23 05:26:18,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:18,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, 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-23 05:26:18,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:18,164 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-23 05:26:18,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:18,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:18,181 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 1926 treesize of output 1770 [2022-07-23 05:26:18,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:18,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:18,206 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 2386 treesize of output 2198 [2022-07-23 05:26:18,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:18,233 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 2194 treesize of output 2104 [2022-07-23 05:26:18,268 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:18,268 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 2090 treesize of output 2006 [2022-07-23 05:26:18,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:18,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:18,324 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 2288 treesize of output 2156 [2022-07-23 05:26:18,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:18,440 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 382 treesize of output 378