./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e6ddc72db9996307e31b37c1f23ddad101cfdc849bb3a24fd3b76db809c7055 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:26:26,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:26:26,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:26:26,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:26:26,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:26:26,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:26:26,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:26:26,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:26:26,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:26:26,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:26:26,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:26:26,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:26:26,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:26:26,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:26:26,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:26:26,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:26:26,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:26:26,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:26:26,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:26:26,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:26:26,761 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:26:26,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:26:26,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:26:26,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:26:26,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:26:26,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:26:26,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:26:26,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:26:26,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:26:26,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:26:26,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:26:26,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:26:26,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:26:26,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:26:26,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:26:26,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:26:26,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:26:26,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:26:26,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:26:26,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:26:26,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:26:26,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:26:26,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:26:26,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:26:26,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:26:26,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:26:26,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:26:26,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:26:26,812 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:26:26,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:26:26,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:26:26,813 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:26:26,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:26:26,814 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:26:26,815 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:26:26,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:26:26,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:26:26,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:26:26,815 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:26:26,815 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:26:26,816 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:26:26,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:26:26,816 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:26:26,816 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:26:26,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:26:26,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:26:26,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:26:26,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:26:26,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:26:26,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:26:26,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:26:26,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:26:26,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:26:26,818 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 9e6ddc72db9996307e31b37c1f23ddad101cfdc849bb3a24fd3b76db809c7055 [2022-07-14 06:26:27,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:26:27,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:26:27,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:26:27,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:26:27,094 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:26:27,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i [2022-07-14 06:26:27,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e25c93d/f6af394714be4513b0e2255ad638f3c9/FLAGf86c32b07 [2022-07-14 06:26:27,657 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:26:27,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i [2022-07-14 06:26:27,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e25c93d/f6af394714be4513b0e2255ad638f3c9/FLAGf86c32b07 [2022-07-14 06:26:27,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e25c93d/f6af394714be4513b0e2255ad638f3c9 [2022-07-14 06:26:28,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:26:28,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:26:28,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:26:28,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:26:28,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:26:28,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:26:27" (1/1) ... [2022-07-14 06:26:28,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed25b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28, skipping insertion in model container [2022-07-14 06:26:28,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:26:27" (1/1) ... [2022-07-14 06:26:28,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:26:28,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:26:28,347 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/list-ext-properties/list-ext_flag_1.i[23654,23667] [2022-07-14 06:26:28,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:26:28,362 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:26:28,400 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/list-ext-properties/list-ext_flag_1.i[23654,23667] [2022-07-14 06:26:28,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:26:28,427 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:26:28,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28 WrapperNode [2022-07-14 06:26:28,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:26:28,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:26:28,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:26:28,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:26:28,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (1/1) ... [2022-07-14 06:26:28,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (1/1) ... [2022-07-14 06:26:28,492 INFO L137 Inliner]: procedures = 124, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 113 [2022-07-14 06:26:28,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:26:28,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:26:28,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:26:28,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:26:28,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (1/1) ... [2022-07-14 06:26:28,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (1/1) ... [2022-07-14 06:26:28,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (1/1) ... [2022-07-14 06:26:28,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (1/1) ... [2022-07-14 06:26:28,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (1/1) ... [2022-07-14 06:26:28,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (1/1) ... [2022-07-14 06:26:28,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (1/1) ... [2022-07-14 06:26:28,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:26:28,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:26:28,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:26:28,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:26:28,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (1/1) ... [2022-07-14 06:26:28,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:26:28,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:28,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:26:28,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:26:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-14 06:26:28,625 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-14 06:26:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:26:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:26:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:26:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:26:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:26:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:26:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:26:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:26:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:26:28,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:26:28,754 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:26:28,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:26:28,817 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-14 06:26:29,091 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:26:29,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:26:29,098 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 06:26:29,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:26:29 BoogieIcfgContainer [2022-07-14 06:26:29,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:26:29,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:26:29,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:26:29,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:26:29,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:26:27" (1/3) ... [2022-07-14 06:26:29,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f6640f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:26:29, skipping insertion in model container [2022-07-14 06:26:29,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:28" (2/3) ... [2022-07-14 06:26:29,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f6640f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:26:29, skipping insertion in model container [2022-07-14 06:26:29,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:26:29" (3/3) ... [2022-07-14 06:26:29,110 INFO L111 eAbstractionObserver]: Analyzing ICFG list-ext_flag_1.i [2022-07-14 06:26:29,125 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:26:29,125 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2022-07-14 06:26:29,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:26:29,190 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@55820293, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58310d6b [2022-07-14 06:26:29,191 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2022-07-14 06:26:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 48 states have (on average 2.125) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:26:29,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:29,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:26:29,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:29,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517928, now seen corresponding path program 1 times [2022-07-14 06:26:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:29,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430428392] [2022-07-14 06:26:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:29,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:29,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:29,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430428392] [2022-07-14 06:26:29,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430428392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:29,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:29,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:26:29,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192826018] [2022-07-14 06:26:29,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:29,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 06:26:29,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:29,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 06:26:29,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:26:29,405 INFO L87 Difference]: Start difference. First operand has 91 states, 48 states have (on average 2.125) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:29,430 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-07-14 06:26:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 06:26:29,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:26:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:29,438 INFO L225 Difference]: With dead ends: 91 [2022-07-14 06:26:29,438 INFO L226 Difference]: Without dead ends: 85 [2022-07-14 06:26:29,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:26:29,443 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:29,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:26:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-14 06:26:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-14 06:26:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-07-14 06:26:29,483 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 6 [2022-07-14 06:26:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:29,483 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-07-14 06:26:29,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-07-14 06:26:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:26:29,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:29,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:29,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:26:29,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash 620871761, now seen corresponding path program 1 times [2022-07-14 06:26:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:29,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9572194] [2022-07-14 06:26:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:29,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:29,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:29,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9572194] [2022-07-14 06:26:29,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9572194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:29,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:29,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:26:29,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728149086] [2022-07-14 06:26:29,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:29,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:26:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:29,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:26:29,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:26:29,605 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:29,785 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-07-14 06:26:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:26:29,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:26:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:29,787 INFO L225 Difference]: With dead ends: 96 [2022-07-14 06:26:29,787 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 06:26:29,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:26:29,789 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 151 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:29,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 45 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:26:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 06:26:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2022-07-14 06:26:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.75) internal successors, (91), 77 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2022-07-14 06:26:29,808 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 8 [2022-07-14 06:26:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:29,810 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2022-07-14 06:26:29,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-07-14 06:26:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:26:29,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:29,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:29,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:26:29,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:29,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:29,817 INFO L85 PathProgramCache]: Analyzing trace with hash 620871762, now seen corresponding path program 1 times [2022-07-14 06:26:29,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:29,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415495006] [2022-07-14 06:26:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:29,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:29,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415495006] [2022-07-14 06:26:29,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415495006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:29,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:29,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:26:29,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181472259] [2022-07-14 06:26:29,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:29,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:26:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:29,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:26:29,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:26:29,890 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:30,077 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2022-07-14 06:26:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:26:30,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:26:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:30,084 INFO L225 Difference]: With dead ends: 116 [2022-07-14 06:26:30,085 INFO L226 Difference]: Without dead ends: 116 [2022-07-14 06:26:30,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:26:30,087 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 165 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:30,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 56 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:26:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-14 06:26:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2022-07-14 06:26:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 101 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2022-07-14 06:26:30,096 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 8 [2022-07-14 06:26:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:30,096 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2022-07-14 06:26:30,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2022-07-14 06:26:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:26:30,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:30,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:30,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:26:30,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:30,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash 623916195, now seen corresponding path program 1 times [2022-07-14 06:26:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:30,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985241116] [2022-07-14 06:26:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:30,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:30,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985241116] [2022-07-14 06:26:30,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985241116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:30,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:30,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:26:30,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976068433] [2022-07-14 06:26:30,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:30,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:26:30,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:30,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:26:30,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:26:30,184 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:30,295 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2022-07-14 06:26:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:26:30,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:26:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:30,297 INFO L225 Difference]: With dead ends: 132 [2022-07-14 06:26:30,297 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 06:26:30,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:26:30,299 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:30,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 209 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:26:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 06:26:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2022-07-14 06:26:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-07-14 06:26:30,306 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 15 [2022-07-14 06:26:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:30,307 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-07-14 06:26:30,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-07-14 06:26:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:26:30,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:30,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:30,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:26:30,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1684958094, now seen corresponding path program 1 times [2022-07-14 06:26:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:30,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969557427] [2022-07-14 06:26:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:30,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:30,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:30,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969557427] [2022-07-14 06:26:30,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969557427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:30,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:30,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:26:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950493979] [2022-07-14 06:26:30,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:30,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:26:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:30,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:26:30,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:26:30,401 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:30,599 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2022-07-14 06:26:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:26:30,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 06:26:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:30,601 INFO L225 Difference]: With dead ends: 153 [2022-07-14 06:26:30,602 INFO L226 Difference]: Without dead ends: 153 [2022-07-14 06:26:30,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:26:30,605 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 107 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:30,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 199 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:26:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-14 06:26:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 106. [2022-07-14 06:26:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.5125) internal successors, (121), 105 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2022-07-14 06:26:30,627 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 17 [2022-07-14 06:26:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:30,627 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2022-07-14 06:26:30,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2022-07-14 06:26:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:26:30,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:30,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:30,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:26:30,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:30,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1529942363, now seen corresponding path program 1 times [2022-07-14 06:26:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:30,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570720456] [2022-07-14 06:26:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:30,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570720456] [2022-07-14 06:26:30,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570720456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:30,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:30,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:26:30,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264828880] [2022-07-14 06:26:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:30,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:26:30,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:30,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:26:30,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:26:30,678 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:30,771 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2022-07-14 06:26:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:26:30,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:26:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:30,772 INFO L225 Difference]: With dead ends: 112 [2022-07-14 06:26:30,772 INFO L226 Difference]: Without dead ends: 112 [2022-07-14 06:26:30,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:26:30,774 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 141 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:30,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 77 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:26:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-14 06:26:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2022-07-14 06:26:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5) internal successors, (123), 107 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2022-07-14 06:26:30,778 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 18 [2022-07-14 06:26:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:30,778 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-07-14 06:26:30,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-07-14 06:26:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:26:30,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:30,779 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] [2022-07-14 06:26:30,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:26:30,780 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1395789589, now seen corresponding path program 1 times [2022-07-14 06:26:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:30,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949141857] [2022-07-14 06:26:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:30,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:30,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949141857] [2022-07-14 06:26:30,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949141857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:30,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:30,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:26:30,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211969318] [2022-07-14 06:26:30,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:30,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:26:30,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:30,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:26:30,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:26:30,863 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:30,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:30,996 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2022-07-14 06:26:30,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:26:30,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 06:26:30,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:31,000 INFO L225 Difference]: With dead ends: 138 [2022-07-14 06:26:31,001 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 06:26:31,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:26:31,004 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:31,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 185 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:26:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 06:26:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2022-07-14 06:26:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 111 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2022-07-14 06:26:31,014 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 20 [2022-07-14 06:26:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:31,014 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2022-07-14 06:26:31,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2022-07-14 06:26:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:26:31,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:31,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:31,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:26:31,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1499534887, now seen corresponding path program 1 times [2022-07-14 06:26:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:31,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121336506] [2022-07-14 06:26:31,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:31,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:31,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121336506] [2022-07-14 06:26:31,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121336506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:31,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:31,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:26:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418119773] [2022-07-14 06:26:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:31,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:26:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:31,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:26:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:26:31,074 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:31,228 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2022-07-14 06:26:31,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:26:31,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:26:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:31,230 INFO L225 Difference]: With dead ends: 113 [2022-07-14 06:26:31,230 INFO L226 Difference]: Without dead ends: 113 [2022-07-14 06:26:31,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:26:31,233 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 111 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:31,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 162 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:26:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-14 06:26:31,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2022-07-14 06:26:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 109 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2022-07-14 06:26:31,238 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 21 [2022-07-14 06:26:31,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:31,238 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2022-07-14 06:26:31,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2022-07-14 06:26:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:26:31,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:31,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:31,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:26:31,247 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:31,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:31,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1499534886, now seen corresponding path program 1 times [2022-07-14 06:26:31,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:31,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874778347] [2022-07-14 06:26:31,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:31,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:31,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874778347] [2022-07-14 06:26:31,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874778347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:31,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:31,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:26:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842513069] [2022-07-14 06:26:31,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:31,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:26:31,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:31,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:26:31,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:26:31,360 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:31,559 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2022-07-14 06:26:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:26:31,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:26:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:31,560 INFO L225 Difference]: With dead ends: 108 [2022-07-14 06:26:31,560 INFO L226 Difference]: Without dead ends: 108 [2022-07-14 06:26:31,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:26:31,561 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 65 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:31,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 219 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:26:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-14 06:26:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2022-07-14 06:26:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.394736842105263) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2022-07-14 06:26:31,563 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 21 [2022-07-14 06:26:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:31,564 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2022-07-14 06:26:31,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2022-07-14 06:26:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:26:31,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:31,564 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] [2022-07-14 06:26:31,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:26:31,565 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:31,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:31,565 INFO L85 PathProgramCache]: Analyzing trace with hash 37796891, now seen corresponding path program 1 times [2022-07-14 06:26:31,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:31,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797052098] [2022-07-14 06:26:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:31,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:31,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:31,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797052098] [2022-07-14 06:26:31,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797052098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:31,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:31,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:26:31,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102657696] [2022-07-14 06:26:31,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:31,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:26:31,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:31,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:26:31,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:26:31,682 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:31,856 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2022-07-14 06:26:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:26:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-14 06:26:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:31,857 INFO L225 Difference]: With dead ends: 110 [2022-07-14 06:26:31,857 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 06:26:31,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:26:31,858 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 118 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:31,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 161 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:26:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 06:26:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2022-07-14 06:26:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 82 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2022-07-14 06:26:31,861 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 22 [2022-07-14 06:26:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:31,861 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2022-07-14 06:26:31,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2022-07-14 06:26:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:26:31,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:31,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:31,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:26:31,862 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash 615949290, now seen corresponding path program 1 times [2022-07-14 06:26:31,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:31,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024742121] [2022-07-14 06:26:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:32,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:32,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024742121] [2022-07-14 06:26:32,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024742121] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:32,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175010401] [2022-07-14 06:26:32,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:32,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:32,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:32,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:32,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 06:26:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:32,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 06:26:32,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:32,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:32,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:32,484 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 22 treesize of output 21 [2022-07-14 06:26:32,543 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:32,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:26:32,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:32,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:32,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:32,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:32,619 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 31 treesize of output 33 [2022-07-14 06:26:32,657 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 20 treesize of output 8 [2022-07-14 06:26:32,738 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 24 treesize of output 24 [2022-07-14 06:26:32,764 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 24 treesize of output 24 [2022-07-14 06:26:32,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:32,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:32,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-07-14 06:26:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:32,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:32,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-14 06:26:32,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-14 06:26:32,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-14 06:26:32,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_196 Int) (v_ArrVal_200 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_196)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-14 06:26:33,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:33,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:33,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:33,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:33,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2022-07-14 06:26:33,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:33,168 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-14 06:26:33,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2022-07-14 06:26:33,175 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 22 treesize of output 18 [2022-07-14 06:26:33,185 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:33,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:26:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-14 06:26:33,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175010401] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:33,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:33,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2022-07-14 06:26:33,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276561218] [2022-07-14 06:26:33,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:33,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-14 06:26:33,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:33,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-14 06:26:33,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=904, Unknown=4, NotChecked=268, Total=1406 [2022-07-14 06:26:33,259 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:33,952 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2022-07-14 06:26:33,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:26:33,953 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-14 06:26:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:33,953 INFO L225 Difference]: With dead ends: 185 [2022-07-14 06:26:33,953 INFO L226 Difference]: Without dead ends: 185 [2022-07-14 06:26:33,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=377, Invalid=1195, Unknown=4, NotChecked=316, Total=1892 [2022-07-14 06:26:33,954 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 224 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 842 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:33,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 770 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 732 Invalid, 0 Unknown, 842 Unchecked, 0.4s Time] [2022-07-14 06:26:33,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-14 06:26:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 103. [2022-07-14 06:26:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 102 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2022-07-14 06:26:33,957 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 30 [2022-07-14 06:26:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:33,958 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2022-07-14 06:26:33,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:33,958 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2022-07-14 06:26:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:26:33,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:33,959 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:33,986 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-14 06:26:34,167 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,SelfDestructingSolverStorable10 [2022-07-14 06:26:34,168 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash 615641460, now seen corresponding path program 1 times [2022-07-14 06:26:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:34,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489477775] [2022-07-14 06:26:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:34,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:34,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489477775] [2022-07-14 06:26:34,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489477775] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:34,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237079543] [2022-07-14 06:26:34,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:34,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:34,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:34,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:34,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:26:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:34,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-14 06:26:34,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:34,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:26:34,577 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:34,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:26:34,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:34,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:26:34,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:34,674 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 20 treesize of output 8 [2022-07-14 06:26:34,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:26:34,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:26:34,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:26:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:34,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:34,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-14 06:26:34,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-14 06:26:34,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-14 06:26:34,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 Int) (v_ArrVal_276 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_272)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-14 06:26:34,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:34,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:34,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-14 06:26:34,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:34,910 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 33 [2022-07-14 06:26:34,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 06:26:35,062 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:35,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:26:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-14 06:26:35,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237079543] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:35,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:35,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2022-07-14 06:26:35,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074914038] [2022-07-14 06:26:35,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:35,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 06:26:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 06:26:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=485, Unknown=4, NotChecked=196, Total=812 [2022-07-14 06:26:35,108 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:35,559 INFO L93 Difference]: Finished difference Result 265 states and 298 transitions. [2022-07-14 06:26:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:26:35,560 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-14 06:26:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:35,561 INFO L225 Difference]: With dead ends: 265 [2022-07-14 06:26:35,561 INFO L226 Difference]: Without dead ends: 265 [2022-07-14 06:26:35,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=723, Unknown=4, NotChecked=244, Total=1190 [2022-07-14 06:26:35,562 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 322 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 744 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:35,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 657 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 515 Invalid, 0 Unknown, 744 Unchecked, 0.3s Time] [2022-07-14 06:26:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-14 06:26:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 105. [2022-07-14 06:26:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 104 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2022-07-14 06:26:35,565 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 30 [2022-07-14 06:26:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:35,565 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2022-07-14 06:26:35,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2022-07-14 06:26:35,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:26:35,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:35,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:35,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:35,767 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,SelfDestructingSolverStorable11 [2022-07-14 06:26:35,767 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1355563894, now seen corresponding path program 1 times [2022-07-14 06:26:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:35,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182387710] [2022-07-14 06:26:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:35,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:35,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:35,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182387710] [2022-07-14 06:26:35,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182387710] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:35,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904436928] [2022-07-14 06:26:35,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:35,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:35,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:35,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:35,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:26:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:36,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-14 06:26:36,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:36,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:26:36,168 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:36,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:26:36,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:36,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:36,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:26:36,279 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 20 treesize of output 8 [2022-07-14 06:26:36,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:26:36,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:26:36,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:26:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:36,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:36,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-14 06:26:36,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-14 06:26:36,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-14 06:26:36,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int)) (v_ArrVal_349 Int)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_349)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-14 06:26:36,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:36,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-14 06:26:36,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:36,528 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 33 [2022-07-14 06:26:36,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 06:26:36,642 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:36,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:26:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-14 06:26:36,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904436928] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:36,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:36,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2022-07-14 06:26:36,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113661673] [2022-07-14 06:26:36,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:36,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 06:26:36,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 06:26:36,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=485, Unknown=4, NotChecked=196, Total=812 [2022-07-14 06:26:36,686 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:37,238 INFO L93 Difference]: Finished difference Result 215 states and 241 transitions. [2022-07-14 06:26:37,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:26:37,238 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-14 06:26:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:37,239 INFO L225 Difference]: With dead ends: 215 [2022-07-14 06:26:37,240 INFO L226 Difference]: Without dead ends: 215 [2022-07-14 06:26:37,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=768, Unknown=4, NotChecked=252, Total=1260 [2022-07-14 06:26:37,241 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 372 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 772 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:37,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 642 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 604 Invalid, 0 Unknown, 772 Unchecked, 0.3s Time] [2022-07-14 06:26:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-14 06:26:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 123. [2022-07-14 06:26:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 122 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2022-07-14 06:26:37,244 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 30 [2022-07-14 06:26:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:37,244 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2022-07-14 06:26:37,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2022-07-14 06:26:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:26:37,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:37,245 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:37,267 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-14 06:26:37,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:37,456 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:37,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:37,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1355871724, now seen corresponding path program 1 times [2022-07-14 06:26:37,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:37,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106812673] [2022-07-14 06:26:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:37,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:37,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:37,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106812673] [2022-07-14 06:26:37,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106812673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:37,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949070359] [2022-07-14 06:26:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:37,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:37,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:37,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:37,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:26:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:37,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-14 06:26:37,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:37,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:37,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:37,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:26:37,908 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:37,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:26:37,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:37,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:37,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:26:37,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:26:37,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:26:37,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:26:38,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:26:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:38,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:38,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:26:38,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:26:38,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:26:38,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_428 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_428)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:26:38,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:38,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:38,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:38,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:38,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2022-07-14 06:26:38,243 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-14 06:26:38,243 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 36 treesize of output 31 [2022-07-14 06:26:38,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:26:38,264 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:38,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:26:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-14 06:26:38,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949070359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:38,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:38,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 31 [2022-07-14 06:26:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996457568] [2022-07-14 06:26:38,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:38,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 06:26:38,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:38,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 06:26:38,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=559, Unknown=7, NotChecked=212, Total=930 [2022-07-14 06:26:38,310 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:38,955 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2022-07-14 06:26:38,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:26:38,955 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-14 06:26:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:38,956 INFO L225 Difference]: With dead ends: 204 [2022-07-14 06:26:38,956 INFO L226 Difference]: Without dead ends: 204 [2022-07-14 06:26:38,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=750, Unknown=7, NotChecked=252, Total=1260 [2022-07-14 06:26:38,957 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 291 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 935 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:38,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 753 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 863 Invalid, 0 Unknown, 935 Unchecked, 0.5s Time] [2022-07-14 06:26:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-14 06:26:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 123. [2022-07-14 06:26:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 122 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2022-07-14 06:26:38,961 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 30 [2022-07-14 06:26:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:38,961 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2022-07-14 06:26:38,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-07-14 06:26:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:26:38,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:38,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:38,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:39,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:39,175 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025696, now seen corresponding path program 1 times [2022-07-14 06:26:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:39,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573548812] [2022-07-14 06:26:39,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:39,385 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-14 06:26:39,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:39,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573548812] [2022-07-14 06:26:39,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573548812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:39,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353293221] [2022-07-14 06:26:39,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:39,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:39,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:39,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:39,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:26:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:39,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:26:39,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:39,597 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:26:39,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:26:39,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:39,753 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:39,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:26:39,782 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:39,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:26:39,866 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 25 treesize of output 13 [2022-07-14 06:26:39,902 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-14 06:26:39,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:40,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_503) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-07-14 06:26:40,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:40,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:26:40,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:40,028 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 40 treesize of output 43 [2022-07-14 06:26:40,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 13 treesize of output 9 [2022-07-14 06:26:40,632 INFO L356 Elim1Store]: treesize reduction 18, result has 63.3 percent of original size [2022-07-14 06:26:40,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 67 [2022-07-14 06:26:40,724 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-14 06:26:40,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353293221] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:40,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:40,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2022-07-14 06:26:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456773009] [2022-07-14 06:26:40,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:40,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:26:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:40,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:26:40,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=816, Unknown=8, NotChecked=60, Total=1056 [2022-07-14 06:26:40,727 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:41,217 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2022-07-14 06:26:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:26:41,218 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-14 06:26:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:41,219 INFO L225 Difference]: With dead ends: 203 [2022-07-14 06:26:41,219 INFO L226 Difference]: Without dead ends: 203 [2022-07-14 06:26:41,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=1180, Unknown=8, NotChecked=74, Total=1560 [2022-07-14 06:26:41,220 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 577 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 660 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:41,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 593 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 676 Invalid, 0 Unknown, 660 Unchecked, 0.3s Time] [2022-07-14 06:26:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-14 06:26:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2022-07-14 06:26:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 125 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2022-07-14 06:26:41,223 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 32 [2022-07-14 06:26:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:41,223 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2022-07-14 06:26:41,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2022-07-14 06:26:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:26:41,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:41,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:41,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:41,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 06:26:41,440 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:41,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:41,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025695, now seen corresponding path program 1 times [2022-07-14 06:26:41,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:41,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617826900] [2022-07-14 06:26:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:41,724 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-14 06:26:41,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617826900] [2022-07-14 06:26:41,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617826900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220937645] [2022-07-14 06:26:41,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:41,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:41,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:41,728 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:41,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:26:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:41,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 06:26:41,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:41,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:41,931 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:41,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:26:41,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:41,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:42,093 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:42,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-14 06:26:42,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:42,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:26:42,119 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:42,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 06:26:42,123 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 22 treesize of output 24 [2022-07-14 06:26:42,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:42,294 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 31 treesize of output 13 [2022-07-14 06:26:42,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:42,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:26:42,311 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-14 06:26:42,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:42,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_65| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_65|)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_65| 8))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (and (<= 0 .cse0) (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))))) is different from false [2022-07-14 06:26:42,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:42,845 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 45 treesize of output 46 [2022-07-14 06:26:42,850 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:42,851 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 35 treesize of output 36 [2022-07-14 06:26:42,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:42,859 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 62 treesize of output 65 [2022-07-14 06:26:42,874 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:42,875 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 96 treesize of output 93 [2022-07-14 06:26:42,879 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 74 treesize of output 66 [2022-07-14 06:26:42,884 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 36 treesize of output 28 [2022-07-14 06:26:43,016 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:43,017 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 22 treesize of output 23 [2022-07-14 06:26:43,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:43,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:43,021 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 20 treesize of output 8 [2022-07-14 06:26:43,363 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:43,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:26:43,450 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-14 06:26:43,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220937645] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:43,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:43,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-07-14 06:26:43,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052820976] [2022-07-14 06:26:43,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:43,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 06:26:43,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:43,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 06:26:43,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=946, Unknown=24, NotChecked=64, Total=1190 [2022-07-14 06:26:43,453 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:44,396 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2022-07-14 06:26:44,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:26:44,396 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-14 06:26:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:44,397 INFO L225 Difference]: With dead ends: 180 [2022-07-14 06:26:44,397 INFO L226 Difference]: Without dead ends: 180 [2022-07-14 06:26:44,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=422, Invalid=1814, Unknown=24, NotChecked=92, Total=2352 [2022-07-14 06:26:44,398 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 362 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 528 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:44,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 874 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 827 Invalid, 0 Unknown, 528 Unchecked, 0.5s Time] [2022-07-14 06:26:44,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-14 06:26:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 124. [2022-07-14 06:26:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 123 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2022-07-14 06:26:44,401 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 32 [2022-07-14 06:26:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:44,402 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2022-07-14 06:26:44,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2022-07-14 06:26:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:26:44,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:44,403 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:44,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:44,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 06:26:44,619 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1553010291, now seen corresponding path program 1 times [2022-07-14 06:26:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:44,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618426483] [2022-07-14 06:26:44,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:44,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:44,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:44,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618426483] [2022-07-14 06:26:44,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618426483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:44,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202314881] [2022-07-14 06:26:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:44,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:44,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:44,795 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:44,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:26:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:44,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 06:26:44,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:44,977 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:44,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:26:45,007 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 13 treesize of output 9 [2022-07-14 06:26:45,107 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:45,108 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 36 treesize of output 34 [2022-07-14 06:26:45,126 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:45,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-14 06:26:45,217 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:45,218 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 24 [2022-07-14 06:26:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:45,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:45,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_654 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2022-07-14 06:26:45,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_654 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2022-07-14 06:26:45,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_76| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_654) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_76| 8)) 0)) (< |v_ULTIMATE.start_main_~p~0#1.offset_76| 0) (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_76|))) is different from false [2022-07-14 06:26:45,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:45,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 06:26:45,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:45,458 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 39 treesize of output 42 [2022-07-14 06:26:45,462 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 22 treesize of output 18 [2022-07-14 06:26:45,693 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:45,693 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 13 treesize of output 12 [2022-07-14 06:26:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-14 06:26:45,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202314881] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:45,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:45,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-07-14 06:26:45,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298411843] [2022-07-14 06:26:45,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:45,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 06:26:45,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:45,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 06:26:45,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-07-14 06:26:45,738 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:46,183 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2022-07-14 06:26:46,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:26:46,184 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 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 33 [2022-07-14 06:26:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:46,184 INFO L225 Difference]: With dead ends: 133 [2022-07-14 06:26:46,185 INFO L226 Difference]: Without dead ends: 133 [2022-07-14 06:26:46,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=1355, Unknown=3, NotChecked=234, Total=1806 [2022-07-14 06:26:46,186 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 106 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:46,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 659 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 302 Invalid, 0 Unknown, 348 Unchecked, 0.1s Time] [2022-07-14 06:26:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-14 06:26:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2022-07-14 06:26:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 123 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2022-07-14 06:26:46,189 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 33 [2022-07-14 06:26:46,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:46,189 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2022-07-14 06:26:46,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2022-07-14 06:26:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:26:46,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:46,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:46,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:46,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:46,403 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1881518547, now seen corresponding path program 1 times [2022-07-14 06:26:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:46,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42556972] [2022-07-14 06:26:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:46,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:46,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:46,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42556972] [2022-07-14 06:26:46,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42556972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:46,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486743401] [2022-07-14 06:26:46,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:46,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:46,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:46,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:46,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:26:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:46,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 06:26:46,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:46,788 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:46,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:26:46,825 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 13 treesize of output 9 [2022-07-14 06:26:46,941 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:46,942 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 36 treesize of output 34 [2022-07-14 06:26:46,961 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:46,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-14 06:26:47,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:47,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2022-07-14 06:26:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:47,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:47,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2022-07-14 06:26:47,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)))) is different from false [2022-07-14 06:26:47,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_86| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_728) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_86| 8)) 0)) (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_86|) (< |v_ULTIMATE.start_main_~p~0#1.offset_86| 0))) is different from false [2022-07-14 06:26:47,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:47,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 06:26:47,263 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:47,264 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 39 treesize of output 42 [2022-07-14 06:26:47,267 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 22 treesize of output 18 [2022-07-14 06:26:47,482 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:47,483 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 13 treesize of output 12 [2022-07-14 06:26:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-14 06:26:47,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486743401] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:47,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:47,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-07-14 06:26:47,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135445668] [2022-07-14 06:26:47,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:47,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 06:26:47,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:47,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 06:26:47,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-07-14 06:26:47,534 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:48,119 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2022-07-14 06:26:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:26:48,123 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 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 33 [2022-07-14 06:26:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:48,124 INFO L225 Difference]: With dead ends: 135 [2022-07-14 06:26:48,124 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 06:26:48,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=1582, Unknown=3, NotChecked=258, Total=2162 [2022-07-14 06:26:48,126 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 122 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:48,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 630 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 356 Invalid, 0 Unknown, 389 Unchecked, 0.2s Time] [2022-07-14 06:26:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 06:26:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2022-07-14 06:26:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.2882882882882882) internal successors, (143), 123 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2022-07-14 06:26:48,129 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 33 [2022-07-14 06:26:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:48,129 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2022-07-14 06:26:48,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-07-14 06:26:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:26:48,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:48,130 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] [2022-07-14 06:26:48,153 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-14 06:26:48,343 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,SelfDestructingSolverStorable17 [2022-07-14 06:26:48,344 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:48,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1240762011, now seen corresponding path program 1 times [2022-07-14 06:26:48,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:48,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683756889] [2022-07-14 06:26:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:26:48,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:48,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683756889] [2022-07-14 06:26:48,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683756889] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:48,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750233422] [2022-07-14 06:26:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:48,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:48,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:48,421 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-14 06:26:48,447 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-14 06:26:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:48,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:26:48,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:48,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:26:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:26:48,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:26:48,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750233422] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:48,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:48,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 06:26:48,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867080398] [2022-07-14 06:26:48,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:48,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:26:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:48,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:26:48,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:26:48,615 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:48,825 INFO L93 Difference]: Finished difference Result 303 states and 342 transitions. [2022-07-14 06:26:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:26:48,826 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:26:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:48,827 INFO L225 Difference]: With dead ends: 303 [2022-07-14 06:26:48,827 INFO L226 Difference]: Without dead ends: 303 [2022-07-14 06:26:48,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:26:48,828 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 357 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:48,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 433 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:26:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-14 06:26:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 154. [2022-07-14 06:26:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.3829787234042554) internal successors, (195), 153 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 195 transitions. [2022-07-14 06:26:48,833 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 195 transitions. Word has length 36 [2022-07-14 06:26:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:48,834 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 195 transitions. [2022-07-14 06:26:48,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 195 transitions. [2022-07-14 06:26:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:26:48,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:48,835 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2022-07-14 06:26:48,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-14 06:26:49,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:49,047 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:49,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:49,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1655615668, now seen corresponding path program 1 times [2022-07-14 06:26:49,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:49,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820758671] [2022-07-14 06:26:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:49,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:49,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820758671] [2022-07-14 06:26:49,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820758671] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:49,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921500118] [2022-07-14 06:26:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:49,250 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:49,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 06:26:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:49,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-14 06:26:49,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:49,421 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:49,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:26:49,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:49,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:49,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:49,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:26:49,594 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:49,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:26:49,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:26:49,617 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:49,617 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 37 treesize of output 35 [2022-07-14 06:26:49,672 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:49,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 89 [2022-07-14 06:26:49,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:49,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-07-14 06:26:49,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-07-14 06:26:49,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2022-07-14 06:26:49,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:49,870 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 32 treesize of output 14 [2022-07-14 06:26:49,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:26:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:49,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:50,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_874 Int) (v_ArrVal_877 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_92| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~p~0#1.offset_92| 8))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_876) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_874)) .cse0) .cse1) 3) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_92| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ 8 .cse1) (select |c_#length| .cse0))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_92|)))))) is different from false [2022-07-14 06:26:50,166 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 199 treesize of output 177 [2022-07-14 06:26:50,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:50,797 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 92 treesize of output 82 [2022-07-14 06:26:50,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:50,804 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 78 treesize of output 68 [2022-07-14 06:26:50,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:50,814 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 116 treesize of output 101 [2022-07-14 06:26:50,819 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 82 treesize of output 74 [2022-07-14 06:26:50,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:50,830 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 136 treesize of output 127 [2022-07-14 06:26:50,836 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 96 [2022-07-14 06:26:51,234 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:51,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:26:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:51,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921500118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:51,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:51,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 43 [2022-07-14 06:26:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827584848] [2022-07-14 06:26:51,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:51,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-14 06:26:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-14 06:26:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1550, Unknown=2, NotChecked=80, Total=1806 [2022-07-14 06:26:51,325 INFO L87 Difference]: Start difference. First operand 154 states and 195 transitions. Second operand has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 43 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:53,535 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2022-07-14 06:26:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:26:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 43 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 06:26:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:53,537 INFO L225 Difference]: With dead ends: 171 [2022-07-14 06:26:53,537 INFO L226 Difference]: Without dead ends: 171 [2022-07-14 06:26:53,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=282, Invalid=2169, Unknown=3, NotChecked=96, Total=2550 [2022-07-14 06:26:53,538 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 115 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:53,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 673 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 460 Invalid, 0 Unknown, 392 Unchecked, 0.2s Time] [2022-07-14 06:26:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-14 06:26:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2022-07-14 06:26:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 145 states have (on average 1.3724137931034484) internal successors, (199), 157 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2022-07-14 06:26:53,542 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 38 [2022-07-14 06:26:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:53,543 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2022-07-14 06:26:53,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 43 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2022-07-14 06:26:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:26:53,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:53,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2022-07-14 06:26:53,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-14 06:26:53,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:53,759 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash -568916534, now seen corresponding path program 1 times [2022-07-14 06:26:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:53,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281068222] [2022-07-14 06:26:53,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:53,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:54,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:54,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281068222] [2022-07-14 06:26:54,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281068222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:54,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265048685] [2022-07-14 06:26:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:54,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:54,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:54,008 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:54,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 06:26:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:54,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-14 06:26:54,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:54,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:54,201 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:54,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-14 06:26:54,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:54,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:54,348 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:54,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:26:54,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:26:54,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:54,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:26:54,412 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:54,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2022-07-14 06:26:54,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:54,421 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 41 treesize of output 36 [2022-07-14 06:26:54,424 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 33 treesize of output 33 [2022-07-14 06:26:54,517 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 40 treesize of output 24 [2022-07-14 06:26:54,519 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 26 treesize of output 14 [2022-07-14 06:26:54,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:26:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:54,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:54,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_958 Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_956) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= (+ .cse0 8) (select |c_#length| .cse1))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_958)) .cse1) .cse0)))))) is different from false [2022-07-14 06:26:54,735 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 452 treesize of output 408 [2022-07-14 06:26:55,195 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:55,195 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 92 treesize of output 82 [2022-07-14 06:26:55,200 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:55,201 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 78 treesize of output 68 [2022-07-14 06:26:55,209 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:55,209 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 116 treesize of output 101 [2022-07-14 06:26:55,220 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:55,221 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 148 treesize of output 139 [2022-07-14 06:26:55,226 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 120 treesize of output 108 [2022-07-14 06:26:55,230 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 96 [2022-07-14 06:26:55,486 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:55,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:26:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:55,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265048685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:55,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:55,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 42 [2022-07-14 06:26:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788924296] [2022-07-14 06:26:55,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:55,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-14 06:26:55,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-14 06:26:55,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1460, Unknown=1, NotChecked=78, Total=1722 [2022-07-14 06:26:55,541 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:56,114 INFO L93 Difference]: Finished difference Result 204 states and 240 transitions. [2022-07-14 06:26:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:26:56,114 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 06:26:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:56,115 INFO L225 Difference]: With dead ends: 204 [2022-07-14 06:26:56,115 INFO L226 Difference]: Without dead ends: 204 [2022-07-14 06:26:56,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=2119, Unknown=1, NotChecked=96, Total=2550 [2022-07-14 06:26:56,116 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 538 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:56,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 571 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 648 Invalid, 0 Unknown, 334 Unchecked, 0.3s Time] [2022-07-14 06:26:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-14 06:26:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 147. [2022-07-14 06:26:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 134 states have (on average 1.373134328358209) internal successors, (184), 146 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 184 transitions. [2022-07-14 06:26:56,120 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 184 transitions. Word has length 38 [2022-07-14 06:26:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:56,120 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 184 transitions. [2022-07-14 06:26:56,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 184 transitions. [2022-07-14 06:26:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:26:56,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:56,121 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-14 06:26:56,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-14 06:26:56,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-14 06:26:56,335 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:56,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:56,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1050061463, now seen corresponding path program 1 times [2022-07-14 06:26:56,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:56,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988626271] [2022-07-14 06:26:56,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:56,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:56,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988626271] [2022-07-14 06:26:56,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988626271] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:56,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779316882] [2022-07-14 06:26:56,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:56,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:56,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:56,511 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:56,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 06:26:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:56,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:26:56,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:56,716 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:56,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:26:56,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:56,852 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:56,853 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 36 treesize of output 34 [2022-07-14 06:26:56,868 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:56,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-14 06:26:57,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:57,002 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 24 [2022-07-14 06:26:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:26:57,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:57,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1032) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)))) is different from false [2022-07-14 06:26:57,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1032) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)))) is different from false [2022-07-14 06:26:57,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_109| Int)) (or (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_109|) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1032) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_109|)) 0)) (< |v_ULTIMATE.start_main_~p~0#1.offset_109| 0))) is different from false [2022-07-14 06:26:57,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:57,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 06:26:57,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:57,222 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 39 treesize of output 42 [2022-07-14 06:26:57,225 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 22 treesize of output 18 [2022-07-14 06:26:57,414 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:57,415 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 13 treesize of output 12 [2022-07-14 06:26:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-07-14 06:26:57,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779316882] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:57,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:57,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2022-07-14 06:26:57,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831765316] [2022-07-14 06:26:57,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:57,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:26:57,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:57,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:26:57,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=763, Unknown=3, NotChecked=174, Total=1056 [2022-07-14 06:26:57,453 INFO L87 Difference]: Start difference. First operand 147 states and 184 transitions. Second operand has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 33 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:57,899 INFO L93 Difference]: Finished difference Result 152 states and 189 transitions. [2022-07-14 06:26:57,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:26:57,899 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 33 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 41 [2022-07-14 06:26:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:57,900 INFO L225 Difference]: With dead ends: 152 [2022-07-14 06:26:57,900 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 06:26:57,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1434, Unknown=3, NotChecked=246, Total=1980 [2022-07-14 06:26:57,901 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 88 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:57,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 539 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 241 Invalid, 0 Unknown, 252 Unchecked, 0.1s Time] [2022-07-14 06:26:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 06:26:57,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2022-07-14 06:26:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 150 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 188 transitions. [2022-07-14 06:26:57,905 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 188 transitions. Word has length 41 [2022-07-14 06:26:57,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:57,905 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 188 transitions. [2022-07-14 06:26:57,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 33 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 188 transitions. [2022-07-14 06:26:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:26:57,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:57,906 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, 1, 1] [2022-07-14 06:26:57,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:58,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 06:26:58,116 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:26:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1570044185, now seen corresponding path program 1 times [2022-07-14 06:26:58,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:26:58,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858797905] [2022-07-14 06:26:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:58,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:26:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:58,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858797905] [2022-07-14 06:26:58,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858797905] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:58,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431141679] [2022-07-14 06:26:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:58,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:58,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:58,530 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:26:58,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 06:26:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:58,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 06:26:58,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:58,720 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:26:58,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:26:58,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:58,906 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:58,906 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 37 treesize of output 35 [2022-07-14 06:26:58,928 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:26:58,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:26:59,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:59,147 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 31 treesize of output 25 [2022-07-14 06:26:59,285 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 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 06:26:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:26:59,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:59,437 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1107 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1)) (forall ((v_ArrVal_1107 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2022-07-14 06:26:59,457 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1107 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_ArrVal_1107 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1))) is different from false [2022-07-14 06:26:59,464 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1107 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1)) (forall ((v_ArrVal_1107 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2022-07-14 06:26:59,469 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:59,469 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 22 treesize of output 23 [2022-07-14 06:26:59,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:59,476 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 36 treesize of output 39 [2022-07-14 06:26:59,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 06:26:59,504 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:59,504 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-14 06:26:59,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:59,509 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 35 treesize of output 38 [2022-07-14 06:26:59,512 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 20 treesize of output 18 [2022-07-14 06:26:59,723 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:59,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:26:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-07-14 06:26:59,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431141679] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:26:59,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:26:59,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 17] total 48 [2022-07-14 06:26:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959279663] [2022-07-14 06:26:59,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:59,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-14 06:26:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:26:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-14 06:26:59,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1831, Unknown=3, NotChecked=270, Total=2352 [2022-07-14 06:26:59,764 INFO L87 Difference]: Start difference. First operand 151 states and 188 transitions. Second operand has 49 states, 48 states have (on average 2.4791666666666665) internal successors, (119), 49 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-14 06:27:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:00,382 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2022-07-14 06:27:00,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:27:00,382 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.4791666666666665) internal successors, (119), 49 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 43 [2022-07-14 06:27:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:00,383 INFO L225 Difference]: With dead ends: 158 [2022-07-14 06:27:00,383 INFO L226 Difference]: Without dead ends: 158 [2022-07-14 06:27:00,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=514, Invalid=3035, Unknown=3, NotChecked=354, Total=3906 [2022-07-14 06:27:00,384 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 155 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:00,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 514 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 250 Invalid, 0 Unknown, 252 Unchecked, 0.1s Time] [2022-07-14 06:27:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-14 06:27:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-07-14 06:27:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 156 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2022-07-14 06:27:00,388 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 43 [2022-07-14 06:27:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:00,388 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2022-07-14 06:27:00,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.4791666666666665) internal successors, (119), 49 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-14 06:27:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-07-14 06:27:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:27:00,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:00,389 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, 1, 1] [2022-07-14 06:27:00,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:00,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-14 06:27:00,603 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1570044186, now seen corresponding path program 1 times [2022-07-14 06:27:00,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:00,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312703381] [2022-07-14 06:27:00,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:00,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:00,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:00,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312703381] [2022-07-14 06:27:00,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312703381] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:00,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949746897] [2022-07-14 06:27:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:00,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:00,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:00,984 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:01,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 06:27:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:01,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-14 06:27:01,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:01,195 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:27:01,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:27:01,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:27:01,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:01,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:01,362 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:01,362 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 37 treesize of output 35 [2022-07-14 06:27:01,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:01,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:27:01,402 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:01,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 06:27:01,406 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 22 treesize of output 24 [2022-07-14 06:27:01,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:01,614 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 31 treesize of output 25 [2022-07-14 06:27:01,620 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:01,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-14 06:27:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:27:01,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:02,021 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_1186 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2022-07-14 06:27:02,040 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1186 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2022-07-14 06:27:02,047 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1187) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) (forall ((v_ArrVal_1186 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2022-07-14 06:27:02,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:02,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2022-07-14 06:27:02,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:02,058 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 31 treesize of output 32 [2022-07-14 06:27:02,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:02,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 57 [2022-07-14 06:27:02,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:02,077 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 84 treesize of output 83 [2022-07-14 06:27:02,081 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 66 treesize of output 62 [2022-07-14 06:27:02,084 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 32 treesize of output 28 [2022-07-14 06:27:02,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:02,278 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 22 treesize of output 23 [2022-07-14 06:27:02,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:02,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:02,283 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 20 treesize of output 10 [2022-07-14 06:27:02,466 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:27:02,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:27:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-07-14 06:27:02,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949746897] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:02,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:02,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 46 [2022-07-14 06:27:02,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645066305] [2022-07-14 06:27:02,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:02,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-14 06:27:02,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:02,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-14 06:27:02,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1670, Unknown=3, NotChecked=258, Total=2162 [2022-07-14 06:27:02,521 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:03,262 INFO L93 Difference]: Finished difference Result 158 states and 195 transitions. [2022-07-14 06:27:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:27:03,262 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 0 states have call successors, (0), 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 43 [2022-07-14 06:27:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:03,263 INFO L225 Difference]: With dead ends: 158 [2022-07-14 06:27:03,263 INFO L226 Difference]: Without dead ends: 158 [2022-07-14 06:27:03,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=446, Invalid=2869, Unknown=3, NotChecked=342, Total=3660 [2022-07-14 06:27:03,265 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 160 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 371 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:03,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 762 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 433 Invalid, 0 Unknown, 371 Unchecked, 0.2s Time] [2022-07-14 06:27:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-14 06:27:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-07-14 06:27:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 144 states have (on average 1.3472222222222223) internal successors, (194), 156 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 194 transitions. [2022-07-14 06:27:03,268 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 194 transitions. Word has length 43 [2022-07-14 06:27:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:03,268 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 194 transitions. [2022-07-14 06:27:03,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 194 transitions. [2022-07-14 06:27:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:27:03,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:03,269 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:03,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:03,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:03,470 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:03,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1048082290, now seen corresponding path program 2 times [2022-07-14 06:27:03,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:03,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826336008] [2022-07-14 06:27:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:03,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:03,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:03,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826336008] [2022-07-14 06:27:03,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826336008] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:03,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817189574] [2022-07-14 06:27:03,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:27:03,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:03,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:03,764 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:03,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 06:27:03,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:27:03,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:27:03,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-14 06:27:03,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:03,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:03,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:03,997 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 22 treesize of output 21 [2022-07-14 06:27:04,019 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:27:04,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:27:04,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:04,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:04,038 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 24 treesize of output 23 [2022-07-14 06:27:04,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:27:04,076 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 15 treesize of output 17 [2022-07-14 06:27:04,097 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 15 treesize of output 17 [2022-07-14 06:27:04,108 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:27:04,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:27:04,120 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 13 treesize of output 9 [2022-07-14 06:27:04,124 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 15 treesize of output 17 [2022-07-14 06:27:04,144 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 20 treesize of output 8 [2022-07-14 06:27:04,173 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 15 treesize of output 17 [2022-07-14 06:27:04,181 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 15 treesize of output 17 [2022-07-14 06:27:04,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:27:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:04,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:04,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1310 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1310) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-14 06:27:04,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1310 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1310) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-14 06:27:04,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1310 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1310) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-14 06:27:04,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1310 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1310) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-14 06:27:04,369 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:27:04,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:27:04,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:04,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:04,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:04,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:04,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2022-07-14 06:27:04,639 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-14 06:27:04,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2022-07-14 06:27:04,644 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 58 treesize of output 50 [2022-07-14 06:27:04,647 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 50 treesize of output 46 [2022-07-14 06:27:04,654 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:27:04,654 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 13 treesize of output 12 [2022-07-14 06:27:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-14 06:27:04,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817189574] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:04,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:04,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 41 [2022-07-14 06:27:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176415589] [2022-07-14 06:27:04,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:04,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-14 06:27:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-14 06:27:04,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1089, Unknown=51, NotChecked=292, Total=1640 [2022-07-14 06:27:04,709 INFO L87 Difference]: Start difference. First operand 157 states and 194 transitions. Second operand has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:08,076 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_33|) 0)) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_main_~t~0#1.base_33| v_ArrVal_1310) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-14 06:27:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:08,360 INFO L93 Difference]: Finished difference Result 375 states and 467 transitions. [2022-07-14 06:27:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:27:08,361 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-14 06:27:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:08,362 INFO L225 Difference]: With dead ends: 375 [2022-07-14 06:27:08,362 INFO L226 Difference]: Without dead ends: 375 [2022-07-14 06:27:08,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=434, Invalid=1968, Unknown=68, NotChecked=500, Total=2970 [2022-07-14 06:27:08,364 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 508 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 2659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1822 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:08,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 940 Invalid, 2659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 726 Invalid, 0 Unknown, 1822 Unchecked, 0.3s Time] [2022-07-14 06:27:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-07-14 06:27:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 191. [2022-07-14 06:27:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 178 states have (on average 1.3202247191011236) internal successors, (235), 190 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 235 transitions. [2022-07-14 06:27:08,370 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 235 transitions. Word has length 43 [2022-07-14 06:27:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:08,370 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 235 transitions. [2022-07-14 06:27:08,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2022-07-14 06:27:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:27:08,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:08,371 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:08,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:08,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:08,583 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:08,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1047774460, now seen corresponding path program 2 times [2022-07-14 06:27:08,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:08,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630879603] [2022-07-14 06:27:08,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:08,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:08,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630879603] [2022-07-14 06:27:08,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630879603] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:08,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229549808] [2022-07-14 06:27:08,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:27:08,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:08,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:08,784 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:08,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-14 06:27:08,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:27:08,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:27:08,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-14 06:27:08,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:08,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:27:09,010 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:27:09,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:27:09,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:09,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:09,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:27:09,086 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 31 treesize of output 13 [2022-07-14 06:27:09,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:09,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:09,194 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:27:09,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:27:09,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:09,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:09,253 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 30 treesize of output 12 [2022-07-14 06:27:09,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:09,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:09,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:27:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:09,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:09,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-14 06:27:09,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-14 06:27:09,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-14 06:27:09,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-14 06:27:09,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0)))) is different from false [2022-07-14 06:27:09,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0)))) is different from false [2022-07-14 06:27:09,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:09,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:09,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-07-14 06:27:09,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:09,563 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 122 treesize of output 121 [2022-07-14 06:27:09,569 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 106 treesize of output 102 [2022-07-14 06:27:09,573 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 102 treesize of output 94 [2022-07-14 06:27:09,874 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:27:09,874 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-14 06:27:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-07-14 06:27:09,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229549808] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:09,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:09,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2022-07-14 06:27:09,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615403370] [2022-07-14 06:27:09,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:09,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-14 06:27:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:09,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-14 06:27:09,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1061, Unknown=12, NotChecked=438, Total=1722 [2022-07-14 06:27:09,926 INFO L87 Difference]: Start difference. First operand 191 states and 235 transitions. Second operand has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:11,826 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-14 06:27:11,895 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1422 Int) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1422)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0))))) is different from false [2022-07-14 06:27:11,942 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0)))) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-14 06:27:11,962 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0))))) is different from false [2022-07-14 06:27:11,975 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0))))) is different from false [2022-07-14 06:27:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:12,148 INFO L93 Difference]: Finished difference Result 394 states and 490 transitions. [2022-07-14 06:27:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-14 06:27:12,149 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 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 43 [2022-07-14 06:27:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:12,150 INFO L225 Difference]: With dead ends: 394 [2022-07-14 06:27:12,150 INFO L226 Difference]: Without dead ends: 394 [2022-07-14 06:27:12,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=570, Invalid=2623, Unknown=43, NotChecked=1320, Total=4556 [2022-07-14 06:27:12,153 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 469 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 3086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2197 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:12,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 985 Invalid, 3086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 771 Invalid, 0 Unknown, 2197 Unchecked, 0.4s Time] [2022-07-14 06:27:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-07-14 06:27:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 213. [2022-07-14 06:27:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 200 states have (on average 1.31) internal successors, (262), 212 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 262 transitions. [2022-07-14 06:27:12,161 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 262 transitions. Word has length 43 [2022-07-14 06:27:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:12,161 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 262 transitions. [2022-07-14 06:27:12,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 262 transitions. [2022-07-14 06:27:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:27:12,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:12,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:12,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:12,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-14 06:27:12,375 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1554014930, now seen corresponding path program 1 times [2022-07-14 06:27:12,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:12,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518500129] [2022-07-14 06:27:12,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:12,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:12,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518500129] [2022-07-14 06:27:12,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518500129] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:12,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500769526] [2022-07-14 06:27:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:12,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:12,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:12,587 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:12,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-14 06:27:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:12,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-14 06:27:12,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:12,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:27:12,858 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:27:12,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:27:12,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:12,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:27:12,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:12,948 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 31 treesize of output 13 [2022-07-14 06:27:13,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:13,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:13,067 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:27:13,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:27:13,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:13,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:13,125 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 30 treesize of output 12 [2022-07-14 06:27:13,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:13,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:13,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:27:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:13,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:13,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-14 06:27:13,239 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-14 06:27:13,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-14 06:27:13,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-14 06:27:13,290 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| Int) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1550) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) 0)))) is different from false [2022-07-14 06:27:13,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| Int) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1550) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2022-07-14 06:27:13,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:13,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:13,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-07-14 06:27:13,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:13,799 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 122 treesize of output 121 [2022-07-14 06:27:13,803 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 106 treesize of output 98 [2022-07-14 06:27:13,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 98 treesize of output 94 [2022-07-14 06:27:14,093 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:27:14,094 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-14 06:27:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 17 not checked. [2022-07-14 06:27:14,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500769526] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:14,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:14,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2022-07-14 06:27:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166208725] [2022-07-14 06:27:14,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:14,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-14 06:27:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-14 06:27:14,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1061, Unknown=13, NotChecked=438, Total=1722 [2022-07-14 06:27:14,134 INFO L87 Difference]: Start difference. First operand 213 states and 262 transitions. Second operand has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:16,509 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| Int) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1550) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-14 06:27:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:16,840 INFO L93 Difference]: Finished difference Result 522 states and 657 transitions. [2022-07-14 06:27:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-14 06:27:16,841 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 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 43 [2022-07-14 06:27:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:16,843 INFO L225 Difference]: With dead ends: 522 [2022-07-14 06:27:16,843 INFO L226 Difference]: Without dead ends: 522 [2022-07-14 06:27:16,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=524, Invalid=2433, Unknown=41, NotChecked=784, Total=3782 [2022-07-14 06:27:16,845 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 694 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1663 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:16,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 939 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 957 Invalid, 0 Unknown, 1663 Unchecked, 0.4s Time] [2022-07-14 06:27:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-07-14 06:27:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 249. [2022-07-14 06:27:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 236 states have (on average 1.2966101694915255) internal successors, (306), 248 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 306 transitions. [2022-07-14 06:27:16,859 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 306 transitions. Word has length 43 [2022-07-14 06:27:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:16,859 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 306 transitions. [2022-07-14 06:27:16,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 306 transitions. [2022-07-14 06:27:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:27:16,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:16,860 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:16,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:17,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-14 06:27:17,084 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:17,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1553707100, now seen corresponding path program 1 times [2022-07-14 06:27:17,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:17,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444052751] [2022-07-14 06:27:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:17,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:17,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:17,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444052751] [2022-07-14 06:27:17,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444052751] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:17,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008124410] [2022-07-14 06:27:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:17,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:17,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:17,352 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:17,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-14 06:27:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:17,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-14 06:27:17,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:17,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:17,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:17,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:27:17,609 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:27:17,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:27:17,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:17,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:27:17,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:17,688 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 25 treesize of output 13 [2022-07-14 06:27:17,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:17,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:17,796 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:27:17,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:27:17,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:17,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:17,853 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 30 treesize of output 12 [2022-07-14 06:27:17,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:17,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:17,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:27:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:17,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:17,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:27:17,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:27:17,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:27:17,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1675) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:27:17,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1675) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)))) is different from false [2022-07-14 06:27:18,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:18,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:18,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:18,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:18,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2022-07-14 06:27:18,248 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-14 06:27:18,248 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 140 treesize of output 129 [2022-07-14 06:27:18,259 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 118 treesize of output 102 [2022-07-14 06:27:18,268 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 55 treesize of output 47 [2022-07-14 06:27:18,304 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:27:18,304 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-14 06:27:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 17 not checked. [2022-07-14 06:27:18,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008124410] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:18,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:18,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 45 [2022-07-14 06:27:18,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161933093] [2022-07-14 06:27:18,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:18,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-14 06:27:18,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-14 06:27:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1273, Unknown=25, NotChecked=400, Total=1980 [2022-07-14 06:27:18,357 INFO L87 Difference]: Start difference. First operand 249 states and 306 transitions. Second operand has 45 states, 45 states have (on average 2.4) internal successors, (108), 45 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:18,691 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1671 Int) (v_ArrVal_1675 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1671)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1675) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1675) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-14 06:27:18,701 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)) (= (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1675) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-14 06:27:18,704 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (not (= |c_ULTIMATE.start_main_#t~mem10#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1675) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) is different from false [2022-07-14 06:27:18,712 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1675) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-14 06:27:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:19,034 INFO L93 Difference]: Finished difference Result 508 states and 643 transitions. [2022-07-14 06:27:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-14 06:27:19,034 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.4) internal successors, (108), 45 states have internal predecessors, (108), 0 states have call successors, (0), 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 43 [2022-07-14 06:27:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:19,036 INFO L225 Difference]: With dead ends: 508 [2022-07-14 06:27:19,036 INFO L226 Difference]: Without dead ends: 508 [2022-07-14 06:27:19,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=495, Invalid=1960, Unknown=31, NotChecked=936, Total=3422 [2022-07-14 06:27:19,037 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 591 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1685 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:19,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 878 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 731 Invalid, 0 Unknown, 1685 Unchecked, 0.4s Time] [2022-07-14 06:27:19,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-07-14 06:27:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 257. [2022-07-14 06:27:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 244 states have (on average 1.2950819672131149) internal successors, (316), 256 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 316 transitions. [2022-07-14 06:27:19,042 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 316 transitions. Word has length 43 [2022-07-14 06:27:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:19,043 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 316 transitions. [2022-07-14 06:27:19,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.4) internal successors, (108), 45 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 316 transitions. [2022-07-14 06:27:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:27:19,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:19,044 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:19,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:19,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-14 06:27:19,268 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:19,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:19,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1811872538, now seen corresponding path program 1 times [2022-07-14 06:27:19,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:19,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115744795] [2022-07-14 06:27:19,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:19,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:19,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:19,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115744795] [2022-07-14 06:27:19,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115744795] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:19,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753202424] [2022-07-14 06:27:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:19,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:19,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:19,310 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:19,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-14 06:27:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:19,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:27:19,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:19,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:19,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753202424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:19,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:19,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-14 06:27:19,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415211265] [2022-07-14 06:27:19,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:19,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:27:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:19,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:27:19,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:27:19,598 INFO L87 Difference]: Start difference. First operand 257 states and 316 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:19,695 INFO L93 Difference]: Finished difference Result 565 states and 626 transitions. [2022-07-14 06:27:19,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:27:19,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 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 43 [2022-07-14 06:27:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:19,697 INFO L225 Difference]: With dead ends: 565 [2022-07-14 06:27:19,697 INFO L226 Difference]: Without dead ends: 565 [2022-07-14 06:27:19,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:27:19,698 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 634 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:19,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 471 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-14 06:27:19,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 310. [2022-07-14 06:27:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 297 states have (on average 1.2323232323232323) internal successors, (366), 309 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 366 transitions. [2022-07-14 06:27:19,705 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 366 transitions. Word has length 43 [2022-07-14 06:27:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:19,705 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 366 transitions. [2022-07-14 06:27:19,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 366 transitions. [2022-07-14 06:27:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:27:19,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:19,706 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, 1, 1, 1] [2022-07-14 06:27:19,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:19,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-14 06:27:19,922 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1278944328, now seen corresponding path program 1 times [2022-07-14 06:27:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:19,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752445862] [2022-07-14 06:27:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:19,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:20,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:20,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752445862] [2022-07-14 06:27:20,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752445862] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:20,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667365823] [2022-07-14 06:27:20,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:20,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:20,200 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:20,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-14 06:27:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:20,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 06:27:20,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:20,467 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:27:20,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:27:20,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:20,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:20,523 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 20 treesize of output 8 [2022-07-14 06:27:20,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:27:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:27:20,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:20,747 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 19 treesize of output 19 [2022-07-14 06:27:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:27:20,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:21,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1862 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1862) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0))) is different from false [2022-07-14 06:27:21,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1862 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1862) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2022-07-14 06:27:21,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_165| Int) (v_ArrVal_1862 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1862) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_165|)) 0) (< |v_ULTIMATE.start_main_~p~0#1.offset_165| 0) (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_165|))) is different from false [2022-07-14 06:27:21,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:21,080 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 22 treesize of output 23 [2022-07-14 06:27:21,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:21,088 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 36 treesize of output 39 [2022-07-14 06:27:21,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:27:21,292 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:27:21,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:27:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-07-14 06:27:21,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667365823] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:21,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:21,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 38 [2022-07-14 06:27:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364552583] [2022-07-14 06:27:21,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:21,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-14 06:27:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:21,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-14 06:27:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1065, Unknown=3, NotChecked=210, Total=1482 [2022-07-14 06:27:21,334 INFO L87 Difference]: Start difference. First operand 310 states and 366 transitions. Second operand has 39 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 39 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:21,928 INFO L93 Difference]: Finished difference Result 338 states and 394 transitions. [2022-07-14 06:27:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:27:21,931 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 39 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-14 06:27:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:21,933 INFO L225 Difference]: With dead ends: 338 [2022-07-14 06:27:21,933 INFO L226 Difference]: Without dead ends: 338 [2022-07-14 06:27:21,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=506, Invalid=2365, Unknown=3, NotChecked=318, Total=3192 [2022-07-14 06:27:21,934 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 346 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:21,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 654 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 421 Invalid, 0 Unknown, 507 Unchecked, 0.2s Time] [2022-07-14 06:27:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-14 06:27:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 315. [2022-07-14 06:27:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 302 states have (on average 1.2350993377483444) internal successors, (373), 314 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 373 transitions. [2022-07-14 06:27:21,940 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 373 transitions. Word has length 45 [2022-07-14 06:27:21,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:21,940 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 373 transitions. [2022-07-14 06:27:21,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 39 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 373 transitions. [2022-07-14 06:27:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:27:21,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:21,941 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1] [2022-07-14 06:27:21,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:22,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:22,155 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1278944379, now seen corresponding path program 1 times [2022-07-14 06:27:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:22,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6159803] [2022-07-14 06:27:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:27:22,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:22,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6159803] [2022-07-14 06:27:22,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6159803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:22,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:22,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:27:22,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852264131] [2022-07-14 06:27:22,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:22,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:27:22,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:22,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:27:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:22,189 INFO L87 Difference]: Start difference. First operand 315 states and 373 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:22,225 INFO L93 Difference]: Finished difference Result 314 states and 371 transitions. [2022-07-14 06:27:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:27:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 45 [2022-07-14 06:27:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:22,227 INFO L225 Difference]: With dead ends: 314 [2022-07-14 06:27:22,227 INFO L226 Difference]: Without dead ends: 314 [2022-07-14 06:27:22,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:22,228 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 14 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:22,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-07-14 06:27:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2022-07-14 06:27:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 302 states have (on average 1.228476821192053) internal successors, (371), 313 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 371 transitions. [2022-07-14 06:27:22,234 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 371 transitions. Word has length 45 [2022-07-14 06:27:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:22,234 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 371 transitions. [2022-07-14 06:27:22,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:22,235 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 371 transitions. [2022-07-14 06:27:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:27:22,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:22,238 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:22,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 06:27:22,238 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:22,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:22,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1888926888, now seen corresponding path program 2 times [2022-07-14 06:27:22,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:22,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200078428] [2022-07-14 06:27:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:22,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:22,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:22,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200078428] [2022-07-14 06:27:22,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200078428] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:22,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869625390] [2022-07-14 06:27:22,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:27:22,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:22,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:22,493 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:22,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-14 06:27:22,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:27:22,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:27:22,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-14 06:27:22,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:22,760 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:27:22,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:27:22,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:22,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:22,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:22,872 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:27:22,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:27:22,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:27:23,002 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 06:27:23,003 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 51 treesize of output 53 [2022-07-14 06:27:23,014 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 8 [2022-07-14 06:27:23,076 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 06:27:23,077 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 60 treesize of output 60 [2022-07-14 06:27:23,091 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 20 treesize of output 12 [2022-07-14 06:27:23,160 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 25 treesize of output 13 [2022-07-14 06:27:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:23,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:23,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2013 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2013) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-07-14 06:27:23,279 INFO L356 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-07-14 06:27:23,280 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 31 treesize of output 30 [2022-07-14 06:27:23,284 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2013 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2013) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) |c_ULTIMATE.start_main_~p~0#1.base|)) is different from false [2022-07-14 06:27:23,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:23,323 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 20 treesize of output 24 [2022-07-14 06:27:23,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:23,441 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-14 06:27:23,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:23,447 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 86 treesize of output 89 [2022-07-14 06:27:23,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:23,454 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 80 treesize of output 68 [2022-07-14 06:27:23,479 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:27:23,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:27:23,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-07-14 06:27:23,689 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:27:23,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:27:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-14 06:27:23,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869625390] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:23,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:23,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 39 [2022-07-14 06:27:23,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972778138] [2022-07-14 06:27:23,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:23,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-14 06:27:23,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:23,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 06:27:23,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1217, Unknown=16, NotChecked=146, Total=1560 [2022-07-14 06:27:23,727 INFO L87 Difference]: Start difference. First operand 314 states and 371 transitions. Second operand has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:24,720 INFO L93 Difference]: Finished difference Result 425 states and 505 transitions. [2022-07-14 06:27:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-14 06:27:24,720 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 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 45 [2022-07-14 06:27:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:24,722 INFO L225 Difference]: With dead ends: 425 [2022-07-14 06:27:24,722 INFO L226 Difference]: Without dead ends: 425 [2022-07-14 06:27:24,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 16 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=505, Invalid=2457, Unknown=16, NotChecked=214, Total=3192 [2022-07-14 06:27:24,723 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 432 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1121 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:24,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1023 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 948 Invalid, 0 Unknown, 1121 Unchecked, 0.4s Time] [2022-07-14 06:27:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-07-14 06:27:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 335. [2022-07-14 06:27:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 323 states have (on average 1.2229102167182662) internal successors, (395), 334 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 395 transitions. [2022-07-14 06:27:24,728 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 395 transitions. Word has length 45 [2022-07-14 06:27:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:24,729 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 395 transitions. [2022-07-14 06:27:24,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 395 transitions. [2022-07-14 06:27:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:27:24,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:24,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:24,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:24,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:24,947 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1888926889, now seen corresponding path program 2 times [2022-07-14 06:27:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:24,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981445024] [2022-07-14 06:27:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:25,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:25,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981445024] [2022-07-14 06:27:25,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981445024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:25,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592698740] [2022-07-14 06:27:25,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:27:25,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:25,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:25,296 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:25,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-14 06:27:25,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:27:25,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:27:25,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 06:27:25,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:25,533 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:27:25,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:27:25,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:25,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:25,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:25,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:25,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:25,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:25,669 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:27:25,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:27:25,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:25,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:27:25,874 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 06:27:25,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 55 [2022-07-14 06:27:25,882 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 8 [2022-07-14 06:27:25,914 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:27:25,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:27:25,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:25,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:27:25,991 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 06:27:25,992 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 62 treesize of output 62 [2022-07-14 06:27:26,072 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 25 treesize of output 13 [2022-07-14 06:27:26,075 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 15 treesize of output 7 [2022-07-14 06:27:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:26,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:26,178 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2135 (Array Int Int))) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2136) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-07-14 06:27:26,197 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2135 (Array Int Int))) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2136) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-07-14 06:27:26,202 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2135) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2135 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2135) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2136) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-07-14 06:27:26,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,210 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 63 treesize of output 67 [2022-07-14 06:27:26,247 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2131) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (forall ((v_ArrVal_2136 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2136) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-14 06:27:26,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,324 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 20 treesize of output 24 [2022-07-14 06:27:26,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,396 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 20 treesize of output 24 [2022-07-14 06:27:26,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,486 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 20 treesize of output 24 [2022-07-14 06:27:26,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,554 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 20 treesize of output 24 [2022-07-14 06:27:26,590 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,591 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 20 treesize of output 24 [2022-07-14 06:27:26,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,647 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 20 treesize of output 24 [2022-07-14 06:27:26,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,680 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 20 treesize of output 24 [2022-07-14 06:27:26,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,743 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 20 treesize of output 24 [2022-07-14 06:27:26,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,772 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 20 treesize of output 24 [2022-07-14 06:27:26,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,788 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 20 treesize of output 24 [2022-07-14 06:27:26,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,817 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 20 treesize of output 24 [2022-07-14 06:27:26,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:26,834 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 20 treesize of output 24 [2022-07-14 06:27:29,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:29,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-14 06:27:29,541 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:29,541 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 70 treesize of output 73 [2022-07-14 06:27:29,546 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 54 treesize of output 46 [2022-07-14 06:27:29,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:29,556 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 37 [2022-07-14 06:27:29,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:29,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-14 06:27:29,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:29,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:29,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:29,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:27:29,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:29,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-14 06:27:29,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:29,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:27:29,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:27:29,699 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 22 treesize of output 10 [2022-07-14 06:27:29,718 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:27:29,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:27:29,878 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:27:29,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:27:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-14 06:27:29,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592698740] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:29,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:29,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 43 [2022-07-14 06:27:29,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302240061] [2022-07-14 06:27:29,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:29,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-14 06:27:29,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-14 06:27:29,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1360, Unknown=27, NotChecked=316, Total=1892 [2022-07-14 06:27:29,922 INFO L87 Difference]: Start difference. First operand 335 states and 395 transitions. Second operand has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:31,312 INFO L93 Difference]: Finished difference Result 426 states and 501 transitions. [2022-07-14 06:27:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-14 06:27:31,313 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 0 states have call successors, (0), 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 45 [2022-07-14 06:27:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:31,314 INFO L225 Difference]: With dead ends: 426 [2022-07-14 06:27:31,314 INFO L226 Difference]: Without dead ends: 426 [2022-07-14 06:27:31,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 66 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=570, Invalid=3325, Unknown=27, NotChecked=500, Total=4422 [2022-07-14 06:27:31,315 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 432 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1165 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:31,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1032 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1032 Invalid, 0 Unknown, 1165 Unchecked, 0.5s Time] [2022-07-14 06:27:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-07-14 06:27:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 343. [2022-07-14 06:27:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 342 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 406 transitions. [2022-07-14 06:27:31,321 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 406 transitions. Word has length 45 [2022-07-14 06:27:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:31,321 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 406 transitions. [2022-07-14 06:27:31,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 406 transitions. [2022-07-14 06:27:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:27:31,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:31,322 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, 1, 1, 1, 1] [2022-07-14 06:27:31,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-14 06:27:31,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:31,531 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash 992568690, now seen corresponding path program 1 times [2022-07-14 06:27:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:31,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848371614] [2022-07-14 06:27:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:31,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:31,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848371614] [2022-07-14 06:27:31,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848371614] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:31,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868713813] [2022-07-14 06:27:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:31,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:31,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:31,779 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:31,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-14 06:27:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:31,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 06:27:31,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:32,051 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:27:32,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:27:32,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:32,160 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:32,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:27:32,175 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:32,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:27:32,263 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:32,264 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 27 treesize of output 23 [2022-07-14 06:27:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:27:32,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:32,399 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2210 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2210) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-14 06:27:32,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2210 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2210) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-14 06:27:32,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2210 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2210) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-14 06:27:32,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:32,421 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 22 treesize of output 23 [2022-07-14 06:27:32,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:32,429 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 36 treesize of output 39 [2022-07-14 06:27:32,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 06:27:32,629 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:27:32,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:27:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-07-14 06:27:32,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868713813] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:32,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:32,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 34 [2022-07-14 06:27:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195641902] [2022-07-14 06:27:32,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:32,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 06:27:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 06:27:32,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=845, Unknown=3, NotChecked=186, Total=1190 [2022-07-14 06:27:32,681 INFO L87 Difference]: Start difference. First operand 343 states and 406 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:33,647 INFO L93 Difference]: Finished difference Result 375 states and 435 transitions. [2022-07-14 06:27:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 06:27:33,647 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 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 46 [2022-07-14 06:27:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:33,649 INFO L225 Difference]: With dead ends: 375 [2022-07-14 06:27:33,649 INFO L226 Difference]: Without dead ends: 375 [2022-07-14 06:27:33,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=490, Invalid=2168, Unknown=6, NotChecked=306, Total=2970 [2022-07-14 06:27:33,650 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 519 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:33,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 925 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1082 Invalid, 0 Unknown, 551 Unchecked, 0.6s Time] [2022-07-14 06:27:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-07-14 06:27:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 337. [2022-07-14 06:27:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 325 states have (on average 1.2276923076923076) internal successors, (399), 336 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 399 transitions. [2022-07-14 06:27:33,655 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 399 transitions. Word has length 46 [2022-07-14 06:27:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:33,656 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 399 transitions. [2022-07-14 06:27:33,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 399 transitions. [2022-07-14 06:27:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:27:33,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:33,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:33,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:33,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:33,880 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:33,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1084740117, now seen corresponding path program 2 times [2022-07-14 06:27:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:33,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403783913] [2022-07-14 06:27:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:34,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:34,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403783913] [2022-07-14 06:27:34,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403783913] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:34,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650503504] [2022-07-14 06:27:34,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:27:34,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:34,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:34,110 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:34,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-14 06:27:34,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:27:34,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:27:34,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 06:27:34,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:34,417 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:27:34,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:27:34,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:34,633 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:34,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2022-07-14 06:27:34,697 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:34,697 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 47 treesize of output 43 [2022-07-14 06:27:34,727 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-14 06:27:34,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:27:34,795 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-14 06:27:34,795 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 53 treesize of output 34 [2022-07-14 06:27:34,960 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:27:34,961 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 80 treesize of output 66 [2022-07-14 06:27:34,992 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:27:34,992 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 77 treesize of output 66 [2022-07-14 06:27:35,136 INFO L356 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2022-07-14 06:27:35,136 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 68 treesize of output 31 [2022-07-14 06:27:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:35,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:35,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2329) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2022-07-14 06:27:35,362 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2329) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2022-07-14 06:27:35,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_197| Int)) (or (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_197|) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2329) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_197|)) 0)) (< |v_ULTIMATE.start_main_~p~0#1.offset_197| 0))) is different from false [2022-07-14 06:27:35,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_197| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2329) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_197|)) 0)) (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_197|) (< |v_ULTIMATE.start_main_~p~0#1.offset_197| 0))) is different from false [2022-07-14 06:27:35,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:35,466 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 21 treesize of output 25 [2022-07-14 06:27:35,697 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:35,698 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 30 treesize of output 31 [2022-07-14 06:27:35,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:35,707 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 173 treesize of output 170 [2022-07-14 06:27:35,713 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 150 treesize of output 134 [2022-07-14 06:27:35,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:35,722 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 145 treesize of output 121 [2022-07-14 06:27:36,184 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:27:36,184 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 3 case distinctions, treesize of input 22 treesize of output 22 [2022-07-14 06:27:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-14 06:27:36,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650503504] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:36,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:36,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 46 [2022-07-14 06:27:36,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470563719] [2022-07-14 06:27:36,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:36,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-14 06:27:36,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:36,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-14 06:27:36,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1568, Unknown=15, NotChecked=332, Total=2070 [2022-07-14 06:27:36,248 INFO L87 Difference]: Start difference. First operand 337 states and 399 transitions. Second operand has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:37,655 INFO L93 Difference]: Finished difference Result 501 states and 585 transitions. [2022-07-14 06:27:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-14 06:27:37,656 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 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 46 [2022-07-14 06:27:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:37,666 INFO L225 Difference]: With dead ends: 501 [2022-07-14 06:27:37,666 INFO L226 Difference]: Without dead ends: 500 [2022-07-14 06:27:37,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=533, Invalid=4724, Unknown=15, NotChecked=580, Total=5852 [2022-07-14 06:27:37,667 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 304 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1494 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:37,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1240 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 692 Invalid, 0 Unknown, 1494 Unchecked, 0.3s Time] [2022-07-14 06:27:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-07-14 06:27:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 367. [2022-07-14 06:27:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 355 states have (on average 1.2169014084507042) internal successors, (432), 366 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 432 transitions. [2022-07-14 06:27:37,696 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 432 transitions. Word has length 46 [2022-07-14 06:27:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:37,696 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 432 transitions. [2022-07-14 06:27:37,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 432 transitions. [2022-07-14 06:27:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:27:37,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:37,697 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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] [2022-07-14 06:27:37,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:37,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:37,897 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash -756231861, now seen corresponding path program 1 times [2022-07-14 06:27:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:37,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078077001] [2022-07-14 06:27:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:38,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:38,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078077001] [2022-07-14 06:27:38,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078077001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:38,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680635470] [2022-07-14 06:27:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:38,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:38,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:38,085 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:38,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-14 06:27:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:38,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 06:27:38,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:38,353 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:27:38,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:27:38,396 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 13 treesize of output 9 [2022-07-14 06:27:38,532 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:38,532 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 47 treesize of output 43 [2022-07-14 06:27:38,583 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:38,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2022-07-14 06:27:38,614 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-14 06:27:38,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:27:38,670 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-14 06:27:38,671 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 53 treesize of output 34 [2022-07-14 06:27:38,827 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:27:38,827 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 80 treesize of output 66 [2022-07-14 06:27:38,854 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:27:38,854 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 77 treesize of output 66 [2022-07-14 06:27:38,975 INFO L356 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2022-07-14 06:27:38,976 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 68 treesize of output 31 [2022-07-14 06:27:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:39,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:39,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2448 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2448) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)))) is different from false [2022-07-14 06:27:39,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2448 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~p~0#1.offset| 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2448) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)))) is different from false [2022-07-14 06:27:39,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2448 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_210| Int)) (or (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_210|) (< |v_ULTIMATE.start_main_~p~0#1.offset_210| 0) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2448) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_210|)) 0)))) is different from false [2022-07-14 06:27:39,212 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2448 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_210| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (< 0 |v_ULTIMATE.start_main_~p~0#1.offset_210|) (< |v_ULTIMATE.start_main_~p~0#1.offset_210| 0) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2448) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_210|)) 0)))) is different from false [2022-07-14 06:27:39,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:39,278 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 21 treesize of output 25 [2022-07-14 06:27:39,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:39,488 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 30 treesize of output 31 [2022-07-14 06:27:39,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:39,499 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 173 treesize of output 170 [2022-07-14 06:27:39,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 150 treesize of output 134 [2022-07-14 06:27:39,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:39,517 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 145 treesize of output 121 [2022-07-14 06:27:40,010 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:27:40,010 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 3 case distinctions, treesize of input 22 treesize of output 22 [2022-07-14 06:27:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-14 06:27:40,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680635470] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:40,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:40,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 46 [2022-07-14 06:27:40,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492808356] [2022-07-14 06:27:40,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:40,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-14 06:27:40,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:40,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-14 06:27:40,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1568, Unknown=15, NotChecked=332, Total=2070 [2022-07-14 06:27:40,068 INFO L87 Difference]: Start difference. First operand 367 states and 432 transitions. Second operand has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:42,125 INFO L93 Difference]: Finished difference Result 505 states and 588 transitions. [2022-07-14 06:27:42,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-14 06:27:42,126 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 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 46 [2022-07-14 06:27:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:42,127 INFO L225 Difference]: With dead ends: 505 [2022-07-14 06:27:42,127 INFO L226 Difference]: Without dead ends: 504 [2022-07-14 06:27:42,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=526, Invalid=4587, Unknown=15, NotChecked=572, Total=5700 [2022-07-14 06:27:42,128 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 272 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1266 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:42,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1510 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1030 Invalid, 0 Unknown, 1266 Unchecked, 0.4s Time] [2022-07-14 06:27:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-14 06:27:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 341. [2022-07-14 06:27:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 329 states have (on average 1.221884498480243) internal successors, (402), 340 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 402 transitions. [2022-07-14 06:27:42,134 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 402 transitions. Word has length 46 [2022-07-14 06:27:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:42,134 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 402 transitions. [2022-07-14 06:27:42,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 402 transitions. [2022-07-14 06:27:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:27:42,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:42,135 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, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:42,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:42,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-14 06:27:42,343 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash 375777400, now seen corresponding path program 1 times [2022-07-14 06:27:42,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:42,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934612149] [2022-07-14 06:27:42,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:42,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:42,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:42,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934612149] [2022-07-14 06:27:42,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934612149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:42,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820710624] [2022-07-14 06:27:42,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:42,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:42,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:42,646 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:42,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-14 06:27:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:42,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-14 06:27:42,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:43,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:43,186 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:43,186 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 45 treesize of output 43 [2022-07-14 06:27:43,204 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:43,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2022-07-14 06:27:43,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:43,407 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 39 treesize of output 33 [2022-07-14 06:27:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:27:43,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:43,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2526 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2526) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2022-07-14 06:27:43,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2526 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2526) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-07-14 06:27:43,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2526 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2526) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-07-14 06:27:43,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:43,930 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 30 treesize of output 31 [2022-07-14 06:27:43,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:43,938 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 52 treesize of output 55 [2022-07-14 06:27:43,942 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 19 treesize of output 17 [2022-07-14 06:27:46,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_407 Int) (v_arrayElimCell_409 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse0 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse2 (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0))) (or (and (= 8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) (not (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_407)) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (and .cse0 (= .cse1 (select (store .cse2 v_arrayElimCell_409 0) v_antiDerIndex_entry0_1))) (and (not .cse0) (= .cse1 (select (store .cse2 v_arrayElimCell_407 0) v_antiDerIndex_entry0_1)))))) is different from false [2022-07-14 06:27:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-07-14 06:27:50,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820710624] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:50,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:50,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 45 [2022-07-14 06:27:50,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924160271] [2022-07-14 06:27:50,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:50,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-14 06:27:50,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-14 06:27:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1554, Unknown=4, NotChecked=332, Total=2070 [2022-07-14 06:27:50,039 INFO L87 Difference]: Start difference. First operand 341 states and 402 transitions. Second operand has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 46 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:56,199 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 54 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 06:27:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:56,658 INFO L93 Difference]: Finished difference Result 361 states and 422 transitions. [2022-07-14 06:27:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:27:56,658 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 46 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-14 06:27:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:56,659 INFO L225 Difference]: With dead ends: 361 [2022-07-14 06:27:56,659 INFO L226 Difference]: Without dead ends: 357 [2022-07-14 06:27:56,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=263, Invalid=2401, Unknown=4, NotChecked=412, Total=3080 [2022-07-14 06:27:56,660 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 54 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:56,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 696 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 311 Unchecked, 0.1s Time] [2022-07-14 06:27:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-07-14 06:27:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 354. [2022-07-14 06:27:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 342 states have (on average 1.213450292397661) internal successors, (415), 353 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 415 transitions. [2022-07-14 06:27:56,666 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 415 transitions. Word has length 48 [2022-07-14 06:27:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:56,666 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 415 transitions. [2022-07-14 06:27:56,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 46 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 415 transitions. [2022-07-14 06:27:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:27:56,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:56,667 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, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:56,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:56,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-14 06:27:56,887 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:27:56,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 718232078, now seen corresponding path program 1 times [2022-07-14 06:27:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:56,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360549594] [2022-07-14 06:27:56,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:57,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360549594] [2022-07-14 06:27:57,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360549594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:57,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452807351] [2022-07-14 06:27:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:57,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:57,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:57,244 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:57,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-14 06:27:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:57,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-14 06:27:57,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:57,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:27:57,756 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:57,757 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 45 treesize of output 43 [2022-07-14 06:27:57,784 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:27:57,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2022-07-14 06:27:58,040 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:58,040 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 39 treesize of output 33 [2022-07-14 06:27:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:27:58,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:58,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2606 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2606) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2022-07-14 06:27:58,541 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2606 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2606) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2022-07-14 06:27:58,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2606 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2606) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-07-14 06:27:58,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:58,555 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 30 treesize of output 31 [2022-07-14 06:27:58,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:58,563 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 52 treesize of output 55 [2022-07-14 06:27:58,567 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 19 treesize of output 17 [2022-07-14 06:28:00,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_414 Int) (v_arrayElimCell_416 Int)) (let ((.cse0 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0)) (.cse2 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (and (not .cse0) (= (select (store .cse1 v_arrayElimCell_414 0) v_antiDerIndex_entry0_2) .cse2)) (and .cse0 (= (select (store .cse1 v_arrayElimCell_416 0) v_antiDerIndex_entry0_2) .cse2)) (and (= 8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) (not (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_414)) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2022-07-14 06:28:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-07-14 06:28:05,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452807351] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:05,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:05,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 45 [2022-07-14 06:28:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399364692] [2022-07-14 06:28:05,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:05,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-14 06:28:05,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:05,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-14 06:28:05,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1554, Unknown=5, NotChecked=332, Total=2070 [2022-07-14 06:28:05,352 INFO L87 Difference]: Start difference. First operand 354 states and 415 transitions. Second operand has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 46 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:05,902 INFO L93 Difference]: Finished difference Result 361 states and 422 transitions. [2022-07-14 06:28:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:28:05,907 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 46 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-14 06:28:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:05,908 INFO L225 Difference]: With dead ends: 361 [2022-07-14 06:28:05,908 INFO L226 Difference]: Without dead ends: 357 [2022-07-14 06:28:05,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=261, Invalid=2402, Unknown=5, NotChecked=412, Total=3080 [2022-07-14 06:28:05,917 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 55 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:05,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 639 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 342 Unchecked, 0.1s Time] [2022-07-14 06:28:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-07-14 06:28:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 341. [2022-07-14 06:28:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 329 states have (on average 1.221884498480243) internal successors, (402), 340 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 402 transitions. [2022-07-14 06:28:05,937 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 402 transitions. Word has length 48 [2022-07-14 06:28:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:05,938 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 402 transitions. [2022-07-14 06:28:05,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 46 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 402 transitions. [2022-07-14 06:28:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:28:05,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:05,952 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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] [2022-07-14 06:28:05,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:06,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-14 06:28:06,171 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:28:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:06,172 INFO L85 PathProgramCache]: Analyzing trace with hash -468457029, now seen corresponding path program 1 times [2022-07-14 06:28:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:06,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985622039] [2022-07-14 06:28:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:28:06,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:06,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985622039] [2022-07-14 06:28:06,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985622039] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:06,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035661323] [2022-07-14 06:28:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:06,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:06,390 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:06,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-14 06:28:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:06,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-14 06:28:06,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:06,651 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:28:06,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:28:06,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:06,809 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:06,809 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 37 treesize of output 35 [2022-07-14 06:28:06,853 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:06,853 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 37 treesize of output 35 [2022-07-14 06:28:06,871 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-14 06:28:06,871 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 22 treesize of output 24 [2022-07-14 06:28:06,917 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-14 06:28:06,918 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 43 treesize of output 30 [2022-07-14 06:28:07,070 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:07,070 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 81 treesize of output 67 [2022-07-14 06:28:07,094 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:07,094 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 78 treesize of output 67 [2022-07-14 06:28:07,279 INFO L356 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2022-07-14 06:28:07,279 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 69 treesize of output 32 [2022-07-14 06:28:07,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:28:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:07,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:07,643 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2727 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2727) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1)) (forall ((v_ArrVal_2727 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2727) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2022-07-14 06:28:07,658 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2727 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2727) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_ArrVal_2727 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2727) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1))) is different from false [2022-07-14 06:28:07,663 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2727 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2727) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_ArrVal_2727 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2727) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1))) is different from false [2022-07-14 06:28:07,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:07,674 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 55 [2022-07-14 06:28:07,690 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ 8 v_prenex_3) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_2727 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2727) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2022-07-14 06:28:07,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:07,756 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 19 treesize of output 23 [2022-07-14 06:28:07,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:07,762 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 18 treesize of output 22 [2022-07-14 06:28:08,006 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:08,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-14 06:28:08,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:08,012 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 148 treesize of output 147 [2022-07-14 06:28:08,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:08,019 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 140 treesize of output 118 [2022-07-14 06:28:08,021 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 102 treesize of output 94 [2022-07-14 06:28:08,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:08,080 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 28 treesize of output 29 [2022-07-14 06:28:08,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:08,086 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 157 treesize of output 156 [2022-07-14 06:28:08,089 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 138 treesize of output 130 [2022-07-14 06:28:08,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:08,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 119 [2022-07-14 06:28:08,483 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:28:08,483 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-14 06:28:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-14 06:28:08,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035661323] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:08,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:08,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 21] total 51 [2022-07-14 06:28:08,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464700401] [2022-07-14 06:28:08,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:08,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-14 06:28:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:08,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-14 06:28:08,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1983, Unknown=13, NotChecked=372, Total=2550 [2022-07-14 06:28:08,542 INFO L87 Difference]: Start difference. First operand 341 states and 402 transitions. Second operand has 51 states, 51 states have (on average 2.6862745098039214) internal successors, (137), 51 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:10,601 INFO L93 Difference]: Finished difference Result 515 states and 598 transitions. [2022-07-14 06:28:10,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-14 06:28:10,601 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.6862745098039214) internal successors, (137), 51 states have internal predecessors, (137), 0 states have call successors, (0), 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 48 [2022-07-14 06:28:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:10,602 INFO L225 Difference]: With dead ends: 515 [2022-07-14 06:28:10,603 INFO L226 Difference]: Without dead ends: 515 [2022-07-14 06:28:10,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 71 SyntacticMatches, 10 SemanticMatches, 88 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=741, Invalid=6572, Unknown=13, NotChecked=684, Total=8010 [2022-07-14 06:28:10,603 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 275 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1863 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:10,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 2284 Invalid, 3301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1380 Invalid, 0 Unknown, 1863 Unchecked, 0.5s Time] [2022-07-14 06:28:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-14 06:28:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2022-07-14 06:28:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 373 states have (on average 1.2091152815013404) internal successors, (451), 384 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 451 transitions. [2022-07-14 06:28:10,609 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 451 transitions. Word has length 48 [2022-07-14 06:28:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:10,610 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 451 transitions. [2022-07-14 06:28:10,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.6862745098039214) internal successors, (137), 51 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 451 transitions. [2022-07-14 06:28:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:28:10,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:10,611 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:10,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:10,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-14 06:28:10,827 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:28:10,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1695364379, now seen corresponding path program 1 times [2022-07-14 06:28:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:10,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566281892] [2022-07-14 06:28:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:28:11,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:11,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566281892] [2022-07-14 06:28:11,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566281892] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:11,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391386239] [2022-07-14 06:28:11,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:11,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:11,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:11,030 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:11,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-14 06:28:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:11,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 06:28:11,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:11,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:28:11,333 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:28:11,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:28:11,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:11,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:11,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:28:11,417 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 31 treesize of output 13 [2022-07-14 06:28:11,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:11,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:11,558 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:28:11,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:28:11,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:11,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:11,622 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 30 treesize of output 12 [2022-07-14 06:28:11,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:11,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:11,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:28:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:28:11,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:11,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2852 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-14 06:28:11,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2852 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-14 06:28:11,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2852 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-14 06:28:11,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2849 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2849) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-14 06:28:11,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2852 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_74| Int) (v_ArrVal_2849 (Array Int Int))) (or (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2849) |v_ULTIMATE.start_main_~t~0#1.base_74| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_74|) 0)))) is different from false [2022-07-14 06:28:11,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2852 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_74| Int) (v_ArrVal_2849 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_74|) 0)) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2849) |v_ULTIMATE.start_main_~t~0#1.base_74| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2022-07-14 06:28:12,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:12,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:12,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-07-14 06:28:12,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:12,044 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 60 treesize of output 63 [2022-07-14 06:28:12,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-14 06:28:12,052 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 46 treesize of output 42 [2022-07-14 06:28:12,302 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:28:12,302 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-14 06:28:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 18 not checked. [2022-07-14 06:28:12,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391386239] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:12,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:12,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2022-07-14 06:28:12,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135943448] [2022-07-14 06:28:12,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:12,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-14 06:28:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:12,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-14 06:28:12,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1278, Unknown=12, NotChecked=474, Total=1980 [2022-07-14 06:28:12,345 INFO L87 Difference]: Start difference. First operand 385 states and 451 transitions. Second operand has 45 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 45 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-14 06:28:15,338 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2844 Int) (|v_ULTIMATE.start_main_~t~0#1.base_74| Int) (v_ArrVal_2849 (Array Int Int))) (or (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_2844)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2849) |v_ULTIMATE.start_main_~t~0#1.base_74| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_74|) 0)))) (forall ((v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2849 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2849) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2022-07-14 06:28:15,357 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2852 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_74| Int) (v_ArrVal_2849 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_74|) 0)) (<= (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2849) |v_ULTIMATE.start_main_~t~0#1.base_74| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) (forall ((v_ArrVal_2852 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2022-07-14 06:28:15,371 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2852 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (forall ((v_ArrVal_2852 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_74| Int) (v_ArrVal_2849 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_74|) 0)) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2849) |v_ULTIMATE.start_main_~t~0#1.base_74| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) is different from false [2022-07-14 06:28:15,380 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2852 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (forall ((v_ArrVal_2852 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_74| Int) (v_ArrVal_2849 (Array Int Int))) (or (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2849) |v_ULTIMATE.start_main_~t~0#1.base_74| v_ArrVal_2852) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_74|) 0))))) is different from false [2022-07-14 06:28:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:15,654 INFO L93 Difference]: Finished difference Result 668 states and 797 transitions. [2022-07-14 06:28:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-14 06:28:15,654 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 45 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 48 [2022-07-14 06:28:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:15,656 INFO L225 Difference]: With dead ends: 668 [2022-07-14 06:28:15,656 INFO L226 Difference]: Without dead ends: 668 [2022-07-14 06:28:15,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 69 SyntacticMatches, 16 SemanticMatches, 81 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=862, Invalid=4397, Unknown=37, NotChecked=1510, Total=6806 [2022-07-14 06:28:15,657 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 537 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1647 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:15,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 998 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1053 Invalid, 0 Unknown, 1647 Unchecked, 0.5s Time] [2022-07-14 06:28:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-07-14 06:28:15,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 413. [2022-07-14 06:28:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 401 states have (on average 1.2044887780548628) internal successors, (483), 412 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 483 transitions. [2022-07-14 06:28:15,663 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 483 transitions. Word has length 48 [2022-07-14 06:28:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:15,663 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 483 transitions. [2022-07-14 06:28:15,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 45 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-14 06:28:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 483 transitions. [2022-07-14 06:28:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 06:28:15,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:15,664 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2022-07-14 06:28:15,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:15,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-14 06:28:15,883 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:28:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1706624104, now seen corresponding path program 2 times [2022-07-14 06:28:15,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:15,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836579782] [2022-07-14 06:28:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:15,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:16,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836579782] [2022-07-14 06:28:16,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836579782] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:16,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060500604] [2022-07-14 06:28:16,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:28:16,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:16,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:16,214 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:16,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-14 06:28:16,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:28:16,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:28:16,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-14 06:28:16,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:16,474 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:28:16,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:28:16,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:28:16,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:16,615 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:16,616 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 37 treesize of output 35 [2022-07-14 06:28:16,657 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-14 06:28:16,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 51 [2022-07-14 06:28:16,661 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 25 treesize of output 15 [2022-07-14 06:28:16,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 [2022-07-14 06:28:17,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:17,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:17,168 INFO L356 Elim1Store]: treesize reduction 54, result has 18.2 percent of original size [2022-07-14 06:28:17,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 46 [2022-07-14 06:28:17,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:17,176 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 19 treesize of output 19 [2022-07-14 06:28:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:28:17,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:18,980 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 71 treesize of output 53 [2022-07-14 06:28:19,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:19,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-14 06:28:19,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:19,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-14 06:28:19,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:19,252 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 20 treesize of output 21 [2022-07-14 06:28:19,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:19,258 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 32 treesize of output 35 [2022-07-14 06:28:19,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:19,262 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-14 06:28:19,573 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:28:19,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:28:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:28:19,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060500604] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:19,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:19,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 48 [2022-07-14 06:28:19,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892622396] [2022-07-14 06:28:19,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:19,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-14 06:28:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:19,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-14 06:28:19,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2077, Unknown=2, NotChecked=0, Total=2256 [2022-07-14 06:28:19,629 INFO L87 Difference]: Start difference. First operand 413 states and 483 transitions. Second operand has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:20,190 INFO L93 Difference]: Finished difference Result 431 states and 500 transitions. [2022-07-14 06:28:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:28:20,191 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 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 50 [2022-07-14 06:28:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:20,192 INFO L225 Difference]: With dead ends: 431 [2022-07-14 06:28:20,192 INFO L226 Difference]: Without dead ends: 404 [2022-07-14 06:28:20,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=281, Invalid=2909, Unknown=2, NotChecked=0, Total=3192 [2022-07-14 06:28:20,193 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 77 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:20,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 929 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 393 Invalid, 0 Unknown, 313 Unchecked, 0.2s Time] [2022-07-14 06:28:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-07-14 06:28:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2022-07-14 06:28:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 392 states have (on average 1.2066326530612246) internal successors, (473), 403 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 473 transitions. [2022-07-14 06:28:20,198 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 473 transitions. Word has length 50 [2022-07-14 06:28:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:20,198 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 473 transitions. [2022-07-14 06:28:20,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 473 transitions. [2022-07-14 06:28:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 06:28:20,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:20,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2022-07-14 06:28:20,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:20,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-07-14 06:28:20,423 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:28:20,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash 93087870, now seen corresponding path program 1 times [2022-07-14 06:28:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:20,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778639100] [2022-07-14 06:28:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:20,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:20,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778639100] [2022-07-14 06:28:20,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778639100] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:20,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952377383] [2022-07-14 06:28:20,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:20,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:20,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:20,752 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:20,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-14 06:28:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:20,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-14 06:28:20,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:21,102 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:28:21,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:28:21,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:21,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:21,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:28:21,247 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:21,247 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 26 treesize of output 26 [2022-07-14 06:28:21,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:21,290 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 06:28:21,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 39 [2022-07-14 06:28:21,293 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 25 treesize of output 15 [2022-07-14 06:28:22,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:22,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:22,077 INFO L356 Elim1Store]: treesize reduction 54, result has 18.2 percent of original size [2022-07-14 06:28:22,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 46 [2022-07-14 06:28:22,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:22,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 19 treesize of output 19 [2022-07-14 06:28:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:28:22,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:24,563 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 71 treesize of output 53 [2022-07-14 06:28:24,601 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:24,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-14 06:28:24,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_280| Int)) (or (and (forall ((v_arrayElimArr_58 (Array Int Int))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_58) |c_ULTIMATE.start_main_~a~0#1.base|) 8))) (not (= (select v_arrayElimArr_58 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_280|)) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.offset_280| 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_280|)) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) |v_ULTIMATE.start_main_~p~0#1.offset_280|))) is different from false [2022-07-14 06:28:24,736 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:24,737 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 20 treesize of output 21 [2022-07-14 06:28:24,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:24,742 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 32 treesize of output 35 [2022-07-14 06:28:24,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:24,745 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-14 06:28:25,021 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:28:25,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:28:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:28:25,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952377383] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:25,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:25,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 48 [2022-07-14 06:28:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960806844] [2022-07-14 06:28:25,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:25,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-14 06:28:25,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:25,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-14 06:28:25,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1970, Unknown=10, NotChecked=90, Total=2256 [2022-07-14 06:28:25,070 INFO L87 Difference]: Start difference. First operand 404 states and 473 transitions. Second operand has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:25,938 INFO L93 Difference]: Finished difference Result 407 states and 475 transitions. [2022-07-14 06:28:25,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:28:25,938 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 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 50 [2022-07-14 06:28:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:25,939 INFO L225 Difference]: With dead ends: 407 [2022-07-14 06:28:25,939 INFO L226 Difference]: Without dead ends: 380 [2022-07-14 06:28:25,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=274, Invalid=2800, Unknown=10, NotChecked=108, Total=3192 [2022-07-14 06:28:25,940 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 136 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:25,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 849 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 510 Invalid, 0 Unknown, 323 Unchecked, 0.2s Time] [2022-07-14 06:28:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-07-14 06:28:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-07-14 06:28:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 368 states have (on average 1.2173913043478262) internal successors, (448), 379 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 448 transitions. [2022-07-14 06:28:25,945 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 448 transitions. Word has length 50 [2022-07-14 06:28:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:25,945 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 448 transitions. [2022-07-14 06:28:25,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 448 transitions. [2022-07-14 06:28:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:28:25,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:25,946 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:25,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:26,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:26,160 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:28:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1464368188, now seen corresponding path program 2 times [2022-07-14 06:28:26,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:26,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814392040] [2022-07-14 06:28:26,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:26,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:26,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814392040] [2022-07-14 06:28:26,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814392040] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:26,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33273412] [2022-07-14 06:28:26,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:28:26,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:26,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:26,711 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:26,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-14 06:28:26,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:28:26,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:28:26,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-14 06:28:26,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:26,988 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:28:26,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:28:27,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:27,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:27,180 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:28:27,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-14 06:28:27,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:28:27,200 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:27,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:28:27,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:27,327 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:27,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:28:27,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:27,336 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 21 [2022-07-14 06:28:27,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:27,341 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 22 treesize of output 21 [2022-07-14 06:28:27,371 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:28:27,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:28:27,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:27,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:27,399 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 24 treesize of output 23 [2022-07-14 06:28:27,407 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 21 treesize of output 20 [2022-07-14 06:28:27,524 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:28:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:28:27,544 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:27,545 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 58 treesize of output 50 [2022-07-14 06:28:27,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:27,549 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 19 treesize of output 21 [2022-07-14 06:28:27,591 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:27,591 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 83 treesize of output 66 [2022-07-14 06:28:27,595 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 27 treesize of output 29 [2022-07-14 06:28:27,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:28:27,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:28:27,709 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:28:27,710 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 27 [2022-07-14 06:28:27,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:28:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:27,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:27,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3143 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int))) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3143) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0))) is different from false [2022-07-14 06:28:27,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3143 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int))) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3143) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0))) is different from false [2022-07-14 06:28:27,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3143 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int))) (not (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_3143) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3144) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3145) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) 0))) is different from false [2022-07-14 06:28:27,935 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:27,935 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 55 treesize of output 59 [2022-07-14 06:28:28,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:28,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:28,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:28,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:28,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 78 [2022-07-14 06:28:28,124 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:28,124 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 126 treesize of output 129 [2022-07-14 06:28:28,127 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 78 treesize of output 58 [2022-07-14 06:28:28,157 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 34 treesize of output 26 [2022-07-14 06:28:28,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-07-14 06:28:28,252 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 34 treesize of output 26 [2022-07-14 06:28:28,272 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 34 treesize of output 26 [2022-07-14 06:28:28,289 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 34 treesize of output 26 [2022-07-14 06:28:28,323 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 34 treesize of output 26 [2022-07-14 06:28:28,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-07-14 06:28:28,444 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 40 treesize of output 32 [2022-07-14 06:28:28,548 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:28,548 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 33 treesize of output 34 [2022-07-14 06:28:28,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:28,555 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 196 treesize of output 193 [2022-07-14 06:28:28,560 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 87 treesize of output 79 [2022-07-14 06:28:28,563 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 166 treesize of output 150 [2022-07-14 06:28:28,610 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:28,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:28:28,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:28,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:28,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:28,615 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 25 treesize of output 13 [2022-07-14 06:28:28,622 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:28:28,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 1 [2022-07-14 06:28:28,625 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 37 treesize of output 29 [2022-07-14 06:28:29,091 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:28:29,092 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 37 treesize of output 35 [2022-07-14 06:28:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-14 06:28:29,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33273412] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:29,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:29,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 55 [2022-07-14 06:28:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358349545] [2022-07-14 06:28:29,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:29,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-14 06:28:29,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:29,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-14 06:28:29,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2354, Unknown=31, NotChecked=306, Total=2970 [2022-07-14 06:28:29,141 INFO L87 Difference]: Start difference. First operand 380 states and 448 transitions. Second operand has 55 states, 55 states have (on average 2.5090909090909093) internal successors, (138), 55 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:30,120 INFO L93 Difference]: Finished difference Result 476 states and 562 transitions. [2022-07-14 06:28:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:28:30,120 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.5090909090909093) internal successors, (138), 55 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-14 06:28:30,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:30,121 INFO L225 Difference]: With dead ends: 476 [2022-07-14 06:28:30,121 INFO L226 Difference]: Without dead ends: 476 [2022-07-14 06:28:30,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=483, Invalid=3530, Unknown=31, NotChecked=378, Total=4422 [2022-07-14 06:28:30,122 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 440 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1204 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:30,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1020 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 763 Invalid, 0 Unknown, 1204 Unchecked, 0.4s Time] [2022-07-14 06:28:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-14 06:28:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 382. [2022-07-14 06:28:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 370 states have (on average 1.2162162162162162) internal successors, (450), 381 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 450 transitions. [2022-07-14 06:28:30,127 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 450 transitions. Word has length 51 [2022-07-14 06:28:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:30,128 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 450 transitions. [2022-07-14 06:28:30,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.5090909090909093) internal successors, (138), 55 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 450 transitions. [2022-07-14 06:28:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:28:30,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:30,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:30,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:30,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:30,343 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:28:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1464060358, now seen corresponding path program 1 times [2022-07-14 06:28:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:30,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123935564] [2022-07-14 06:28:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:30,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:30,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123935564] [2022-07-14 06:28:30,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123935564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:30,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023935742] [2022-07-14 06:28:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:30,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:30,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:30,712 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:30,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-14 06:28:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:30,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-14 06:28:30,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:31,023 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:28:31,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:28:31,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:28:31,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:31,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:31,225 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:31,225 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 40 treesize of output 36 [2022-07-14 06:28:31,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:31,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:31,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:28:31,295 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:31,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2022-07-14 06:28:31,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:31,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:31,354 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 06:28:31,354 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 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-14 06:28:31,372 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-14 06:28:31,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 06:28:31,443 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:28:31,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:28:31,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:28:31,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:31,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:28:31,464 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 06:28:31,464 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 46 treesize of output 33 [2022-07-14 06:28:31,656 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:31,656 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 96 treesize of output 84 [2022-07-14 06:28:31,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:31,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:28:31,670 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:31,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 80 [2022-07-14 06:28:31,699 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:31,699 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 133 treesize of output 112 [2022-07-14 06:28:31,709 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:31,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 98 [2022-07-14 06:28:31,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-07-14 06:28:31,857 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-14 06:28:31,857 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 35 [2022-07-14 06:28:31,860 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 26 treesize of output 14 [2022-07-14 06:28:31,917 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 13 treesize of output 9 [2022-07-14 06:28:31,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:28:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:31,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:32,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3275 (Array Int Int)) (v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3277 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= (+ .cse0 8) (select |c_#length| .cse1))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3276) .cse1) .cse0) 1))))) is different from false [2022-07-14 06:28:32,095 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3275 (Array Int Int)) (v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3277 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= (+ 8 .cse0) (select |c_#length| .cse1))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3276) .cse1) .cse0) 1))))) is different from false [2022-07-14 06:28:32,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3275 (Array Int Int)) (v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3277 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (select (select (store |c_#memory_int| .cse0 v_ArrVal_3276) .cse1) .cse2) 1) (not (<= (+ .cse2 8) (select |c_#length| .cse1))))))) is different from false [2022-07-14 06:28:32,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3275 (Array Int Int)) (v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3277 (Array Int Int)) (v_ArrVal_3268 Int) (v_ArrVal_3266 Int) (v_ArrVal_3270 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_87| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3270) |v_ULTIMATE.start_main_~t~0#1.base_87| v_ArrVal_3275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |v_ULTIMATE.start_main_~t~0#1.base_87|)) |v_ULTIMATE.start_main_~t~0#1.base_87| v_ArrVal_3277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_3268)) |v_ULTIMATE.start_main_~t~0#1.base_87| v_ArrVal_3276) .cse1) .cse2) 1) (not (<= (+ .cse2 8) (select (store |c_#length| |v_ULTIMATE.start_main_~t~0#1.base_87| v_ArrVal_3266) .cse1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_87|) 0)))))) is different from false [2022-07-14 06:28:32,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:32,192 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 93 treesize of output 91 [2022-07-14 06:28:32,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:32,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:32,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2022-07-14 06:28:32,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:32,214 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 118 treesize of output 121 [2022-07-14 06:28:32,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 45 treesize of output 27 [2022-07-14 06:28:33,455 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:33,455 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 161 treesize of output 141 [2022-07-14 06:28:33,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:33,460 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 131 treesize of output 121 [2022-07-14 06:28:33,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:33,469 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 473 treesize of output 326 [2022-07-14 06:28:33,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:33,484 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 1571 treesize of output 1508 [2022-07-14 06:28:33,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:33,501 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 1499 treesize of output 1123 [2022-07-14 06:28:33,509 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 1105 treesize of output 1033 [2022-07-14 06:28:33,517 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 1033 treesize of output 937 [2022-07-14 06:28:33,535 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 937 treesize of output 901 [2022-07-14 06:28:33,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:34,249 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:28:34,250 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-14 06:28:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-14 06:28:34,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023935742] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:34,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:34,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 52 [2022-07-14 06:28:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117007735] [2022-07-14 06:28:34,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:34,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-14 06:28:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-14 06:28:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2005, Unknown=5, NotChecked=380, Total=2652 [2022-07-14 06:28:34,303 INFO L87 Difference]: Start difference. First operand 382 states and 450 transitions. Second operand has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:35,610 INFO L93 Difference]: Finished difference Result 542 states and 631 transitions. [2022-07-14 06:28:35,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:28:35,614 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-14 06:28:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:35,615 INFO L225 Difference]: With dead ends: 542 [2022-07-14 06:28:35,615 INFO L226 Difference]: Without dead ends: 542 [2022-07-14 06:28:35,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=567, Invalid=3604, Unknown=5, NotChecked=516, Total=4692 [2022-07-14 06:28:35,616 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 493 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1488 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:35,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1042 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1168 Invalid, 0 Unknown, 1488 Unchecked, 0.6s Time] [2022-07-14 06:28:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-07-14 06:28:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 407. [2022-07-14 06:28:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 395 states have (on average 1.210126582278481) internal successors, (478), 406 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 478 transitions. [2022-07-14 06:28:35,621 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 478 transitions. Word has length 51 [2022-07-14 06:28:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:35,621 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 478 transitions. [2022-07-14 06:28:35,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 478 transitions. [2022-07-14 06:28:35,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:28:35,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:35,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-14 06:28:35,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:35,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-07-14 06:28:35,840 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:28:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash 703788252, now seen corresponding path program 1 times [2022-07-14 06:28:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:35,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38149979] [2022-07-14 06:28:35,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:36,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38149979] [2022-07-14 06:28:36,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38149979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:36,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200961775] [2022-07-14 06:28:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:36,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:36,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:36,212 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:36,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-14 06:28:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:36,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-14 06:28:36,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:36,542 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:28:36,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:28:36,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:28:36,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:36,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:36,738 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:28:36,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:28:36,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:28:36,758 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:36,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2022-07-14 06:28:36,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:28:36,833 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:36,833 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 40 treesize of output 36 [2022-07-14 06:28:36,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:36,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:36,903 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 06:28:36,903 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 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-14 06:28:36,921 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-14 06:28:36,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 06:28:36,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:36,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:28:36,998 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 06:28:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 33 [2022-07-14 06:28:37,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:37,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:37,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:28:37,182 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:37,183 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 96 treesize of output 84 [2022-07-14 06:28:37,190 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:37,190 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 86 treesize of output 80 [2022-07-14 06:28:37,218 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:37,218 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 133 treesize of output 112 [2022-07-14 06:28:37,226 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:37,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 98 [2022-07-14 06:28:37,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-07-14 06:28:37,370 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-14 06:28:37,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 35 [2022-07-14 06:28:37,373 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 26 treesize of output 14 [2022-07-14 06:28:37,428 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 13 treesize of output 9 [2022-07-14 06:28:37,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:28:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:37,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:37,583 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3409) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3407) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= (+ .cse0 8) (select |c_#length| .cse1))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3408) .cse1) .cse0)))))) is different from false [2022-07-14 06:28:37,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3407) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3409) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3408) .cse0) .cse1) 2) (not (<= (+ .cse1 8) (select |c_#length| .cse0))))))) is different from false [2022-07-14 06:28:37,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3409) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3407) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (<= (+ .cse0 8) (select |c_#length| .cse1))) (= (select (select (store |c_#memory_int| .cse2 v_ArrVal_3408) .cse1) .cse0) 2))))) is different from false [2022-07-14 06:28:37,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3401 Int) (v_ArrVal_3399 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3399) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3407) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3409) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_3401)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3408) .cse1) .cse2) 2) (not (<= (+ 8 .cse2) (select |c_#length| .cse1))))))) is different from false [2022-07-14 06:28:37,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3401 Int) (v_ArrVal_3399 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_90| Int) (v_ArrVal_3398 Int) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 |v_ULTIMATE.start_main_~t~0#1.base_90|)) |v_ULTIMATE.start_main_~t~0#1.base_90| v_ArrVal_3409) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3399) |v_ULTIMATE.start_main_~t~0#1.base_90| v_ArrVal_3407) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_90|) 0)) (not (<= (+ 8 .cse0) (select (store |c_#length| |v_ULTIMATE.start_main_~t~0#1.base_90| v_ArrVal_3398) .cse1))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 v_ArrVal_3401)) |v_ULTIMATE.start_main_~t~0#1.base_90| v_ArrVal_3408) .cse1) .cse0)))))) is different from false [2022-07-14 06:28:37,656 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:37,656 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 93 treesize of output 91 [2022-07-14 06:28:37,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:37,664 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:37,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2022-07-14 06:28:37,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:37,675 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 118 treesize of output 121 [2022-07-14 06:28:37,680 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 45 treesize of output 27 [2022-07-14 06:28:38,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:38,907 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 161 treesize of output 141 [2022-07-14 06:28:38,912 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:38,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 121 [2022-07-14 06:28:38,920 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:38,920 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 473 treesize of output 326 [2022-07-14 06:28:38,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:38,932 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 1571 treesize of output 1508 [2022-07-14 06:28:38,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:38,949 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 1499 treesize of output 1123 [2022-07-14 06:28:38,957 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 1105 treesize of output 1009 [2022-07-14 06:28:38,964 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 1009 treesize of output 937 [2022-07-14 06:28:38,971 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 937 treesize of output 901 [2022-07-14 06:28:39,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:39,696 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:28:39,696 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-14 06:28:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-14 06:28:39,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200961775] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:39,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:39,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 52 [2022-07-14 06:28:39,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596769513] [2022-07-14 06:28:39,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:39,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-14 06:28:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-14 06:28:39,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1917, Unknown=5, NotChecked=470, Total=2652 [2022-07-14 06:28:39,758 INFO L87 Difference]: Start difference. First operand 407 states and 478 transitions. Second operand has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:41,469 INFO L93 Difference]: Finished difference Result 542 states and 630 transitions. [2022-07-14 06:28:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:28:41,470 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-14 06:28:41,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:41,471 INFO L225 Difference]: With dead ends: 542 [2022-07-14 06:28:41,471 INFO L226 Difference]: Without dead ends: 542 [2022-07-14 06:28:41,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=570, Invalid=3477, Unknown=5, NotChecked=640, Total=4692 [2022-07-14 06:28:41,472 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 350 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 3473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1507 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:41,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1415 Invalid, 3473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1906 Invalid, 0 Unknown, 1507 Unchecked, 0.9s Time] [2022-07-14 06:28:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-07-14 06:28:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 409. [2022-07-14 06:28:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 397 states have (on average 1.2090680100755669) internal successors, (480), 408 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 480 transitions. [2022-07-14 06:28:41,477 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 480 transitions. Word has length 51 [2022-07-14 06:28:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:41,477 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 480 transitions. [2022-07-14 06:28:41,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 480 transitions. [2022-07-14 06:28:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:28:41,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:41,478 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:41,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:41,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:41,687 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:28:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash 703480422, now seen corresponding path program 1 times [2022-07-14 06:28:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:41,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37747328] [2022-07-14 06:28:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:42,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:42,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37747328] [2022-07-14 06:28:42,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37747328] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:42,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945429068] [2022-07-14 06:28:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:42,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:42,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:42,193 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:42,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-14 06:28:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:42,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-14 06:28:42,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:42,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:28:42,489 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:28:42,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:28:42,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:42,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:42,699 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:42,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2022-07-14 06:28:42,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:42,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:42,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:42,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:42,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:28:42,830 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:28:42,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:28:42,845 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:42,845 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 40 treesize of output 36 [2022-07-14 06:28:42,916 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-14 06:28:42,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 06:28:42,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:28:42,993 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:28:42,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:28:43,010 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 06:28:43,010 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 46 treesize of output 33 [2022-07-14 06:28:43,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 06:28:43,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:43,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:28:43,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:43,149 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 18 treesize of output 20 [2022-07-14 06:28:43,161 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:43,161 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 57 treesize of output 49 [2022-07-14 06:28:43,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:43,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:43,188 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:43,188 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 82 treesize of output 65 [2022-07-14 06:28:43,191 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 26 treesize of output 28 [2022-07-14 06:28:43,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:28:43,304 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:28:43,304 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2022-07-14 06:28:43,307 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 15 treesize of output 7 [2022-07-14 06:28:43,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:28:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:43,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:43,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3541 (Array Int Int)) (v_ArrVal_3542 (Array Int Int)) (v_ArrVal_3543 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3543) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3542) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0)) is different from false [2022-07-14 06:28:43,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3541 (Array Int Int)) (v_ArrVal_3542 (Array Int Int)) (v_ArrVal_3543 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3543) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3542) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) 0)) is different from false [2022-07-14 06:28:43,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3541 (Array Int Int)) (v_ArrVal_3542 (Array Int Int)) (v_ArrVal_3543 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_3543) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3542) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) 0)) is different from false [2022-07-14 06:28:43,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:43,570 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 54 treesize of output 58 [2022-07-14 06:28:43,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:43,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:43,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:43,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:43,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 77 [2022-07-14 06:28:43,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:43,790 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 124 treesize of output 127 [2022-07-14 06:28:43,795 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 47 treesize of output 27 [2022-07-14 06:28:43,825 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 45 treesize of output 33 [2022-07-14 06:28:43,850 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 45 treesize of output 33 [2022-07-14 06:28:43,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 45 treesize of output 33 [2022-07-14 06:28:43,980 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 45 treesize of output 33 [2022-07-14 06:28:44,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-07-14 06:28:44,065 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 45 treesize of output 33 [2022-07-14 06:28:44,090 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 45 treesize of output 33 [2022-07-14 06:28:44,138 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 45 treesize of output 33 [2022-07-14 06:28:44,164 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 45 treesize of output 33 [2022-07-14 06:28:44,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-07-14 06:28:44,233 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 45 treesize of output 33 [2022-07-14 06:28:44,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2022-07-14 06:28:44,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2022-07-14 06:28:44,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:44,488 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-14 06:28:44,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:44,495 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 164 treesize of output 161 [2022-07-14 06:28:44,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 134 [2022-07-14 06:28:44,506 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 134 treesize of output 118 [2022-07-14 06:28:44,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:44,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:28:44,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:44,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:44,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:44,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:28:44,591 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:28:44,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 1 [2022-07-14 06:28:44,601 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 60 treesize of output 44 [2022-07-14 06:28:44,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:44,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:44,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:44,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:44,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:44,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:45,399 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:28:45,400 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-14 06:28:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-14 06:28:45,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945429068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:45,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:45,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 57 [2022-07-14 06:28:45,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644851638] [2022-07-14 06:28:45,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:45,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-14 06:28:45,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:45,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-14 06:28:45,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2569, Unknown=23, NotChecked=318, Total=3192 [2022-07-14 06:28:45,459 INFO L87 Difference]: Start difference. First operand 409 states and 480 transitions. Second operand has 57 states, 57 states have (on average 2.473684210526316) internal successors, (141), 57 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:47,107 INFO L93 Difference]: Finished difference Result 635 states and 753 transitions. [2022-07-14 06:28:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:28:47,108 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.473684210526316) internal successors, (141), 57 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-14 06:28:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:47,109 INFO L225 Difference]: With dead ends: 635 [2022-07-14 06:28:47,109 INFO L226 Difference]: Without dead ends: 635 [2022-07-14 06:28:47,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=527, Invalid=4018, Unknown=23, NotChecked=402, Total=4970 [2022-07-14 06:28:47,110 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 469 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 3750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1869 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:47,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1740 Invalid, 3750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1800 Invalid, 0 Unknown, 1869 Unchecked, 0.8s Time] [2022-07-14 06:28:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-07-14 06:28:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 407. [2022-07-14 06:28:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 395 states have (on average 1.2050632911392405) internal successors, (476), 406 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 476 transitions. [2022-07-14 06:28:47,115 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 476 transitions. Word has length 51 [2022-07-14 06:28:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:47,115 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 476 transitions. [2022-07-14 06:28:47,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.473684210526316) internal successors, (141), 57 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:28:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 476 transitions. [2022-07-14 06:28:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:28:47,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:47,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:47,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-07-14 06:28:47,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-14 06:28:47,335 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:28:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1924981778, now seen corresponding path program 1 times [2022-07-14 06:28:47,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:47,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172099843] [2022-07-14 06:28:47,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:47,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:47,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172099843] [2022-07-14 06:28:47,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172099843] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887976609] [2022-07-14 06:28:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:47,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:47,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:47,912 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:47,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-14 06:28:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:48,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-14 06:28:48,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:48,271 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:28:48,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:28:48,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:28:48,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:48,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:48,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:48,477 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:28:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-07-14 06:28:48,479 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 15 treesize of output 7 [2022-07-14 06:28:48,498 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:48,498 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 48 treesize of output 44 [2022-07-14 06:28:48,637 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:28:48,637 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 25 treesize of output 29 [2022-07-14 06:28:48,643 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 15 treesize of output 7 [2022-07-14 06:28:48,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:48,654 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 22 treesize of output 21 [2022-07-14 06:28:48,668 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:48,668 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 48 treesize of output 44 [2022-07-14 06:28:48,739 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-14 06:28:48,739 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 22 treesize of output 24 [2022-07-14 06:28:48,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:28:48,819 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:28:48,819 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 25 treesize of output 29 [2022-07-14 06:28:48,822 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 15 treesize of output 7 [2022-07-14 06:28:48,843 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-14 06:28:48,843 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 54 treesize of output 35 [2022-07-14 06:28:48,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:48,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:48,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:48,859 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 31 treesize of output 33 [2022-07-14 06:28:49,099 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:49,100 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 159 treesize of output 139 [2022-07-14 06:28:49,109 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:49,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 137 [2022-07-14 06:28:49,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:49,113 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 48 treesize of output 42 [2022-07-14 06:28:49,147 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:28:49,148 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 204 treesize of output 171 [2022-07-14 06:28:49,156 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:28:49,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 159 [2022-07-14 06:28:49,159 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 66 treesize of output 60 [2022-07-14 06:28:49,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:49,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:49,408 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:28:49,408 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 131 treesize of output 66 [2022-07-14 06:28:49,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:49,412 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 61 treesize of output 31 [2022-07-14 06:28:49,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-14 06:28:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:49,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:49,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3675 (Array Int Int)) (v_ArrVal_3676 (Array Int Int)) (v_ArrVal_3677 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_309| Int)) (let ((.cse2 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_309|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3677) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3676) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_309|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_309| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3675) .cse0) (+ .cse1 4)) 0)) (not (<= (+ 8 .cse1) (select |c_#length| .cse0))))))) is different from false [2022-07-14 06:28:49,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3675 (Array Int Int)) (v_ArrVal_3676 (Array Int Int)) (v_ArrVal_3677 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_309| Int)) (let ((.cse2 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_309|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3676) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3677) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_309|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_309| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ 8 .cse0) (select |c_#length| .cse1))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3675) .cse1) (+ 4 .cse0)) 0)))))) is different from false [2022-07-14 06:28:49,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3675 (Array Int Int)) (v_ArrVal_3676 (Array Int Int)) (v_ArrVal_3677 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_309| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse3 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_309|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3677) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3676) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_309|)) (not (= 0 (select (select (store |c_#memory_int| .cse0 v_ArrVal_3675) .cse1) (+ .cse2 4)))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_309| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ .cse2 8) (select |c_#length| .cse1))))))) is different from false [2022-07-14 06:28:49,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3668 Int) (v_ArrVal_3675 (Array Int Int)) (v_ArrVal_3666 Int) (v_ArrVal_3676 (Array Int Int)) (v_ArrVal_3677 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_309| Int) (|v_ULTIMATE.start_main_~t~0#1.base_96| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) (.cse4 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_309|))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3670) |v_ULTIMATE.start_main_~t~0#1.base_96| v_ArrVal_3677) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse3 (store |c_#length| |v_ULTIMATE.start_main_~t~0#1.base_96| v_ArrVal_3666)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |v_ULTIMATE.start_main_~t~0#1.base_96|)) |v_ULTIMATE.start_main_~t~0#1.base_96| v_ArrVal_3676) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_3668)) |v_ULTIMATE.start_main_~t~0#1.base_96| v_ArrVal_3675) .cse1) (+ .cse2 4)) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_309|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_309| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_~p~0#1.offset| 12) (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_96|))) (not (<= (+ .cse2 8) (select .cse3 .cse1))))))) is different from false [2022-07-14 06:28:49,868 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:49,868 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 96 treesize of output 94 [2022-07-14 06:28:50,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:50,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:50,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:50,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:50,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 78 [2022-07-14 06:28:50,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:50,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:50,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 178 [2022-07-14 06:28:50,175 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 78 treesize of output 58 [2022-07-14 06:29:07,931 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:29:07,931 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 224 treesize of output 194 [2022-07-14 06:29:07,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:29:07,937 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 184 treesize of output 164 [2022-07-14 06:29:07,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:29:07,949 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 934 treesize of output 895 [2022-07-14 06:29:07,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:29:07,972 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 3090 treesize of output 2979 [2022-07-14 06:29:07,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:29:07,997 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 2985 treesize of output 2277 [2022-07-14 06:29:08,010 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 2248 treesize of output 2072 [2022-07-14 06:29:08,022 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 2072 treesize of output 1912 [2022-07-14 06:29:08,036 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 1912 treesize of output 1832 [2022-07-14 06:29:09,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:29:09,951 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-14 06:29:09,952 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-14 06:29:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-14 06:29:10,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887976609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:29:10,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:29:10,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 61 [2022-07-14 06:29:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017804966] [2022-07-14 06:29:10,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:29:10,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-14 06:29:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:29:10,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-14 06:29:10,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2901, Unknown=12, NotChecked=452, Total=3660 [2022-07-14 06:29:10,085 INFO L87 Difference]: Start difference. First operand 407 states and 476 transitions. Second operand has 61 states, 61 states have (on average 2.3278688524590163) internal successors, (142), 61 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:29:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:29:11,451 INFO L93 Difference]: Finished difference Result 448 states and 520 transitions. [2022-07-14 06:29:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:29:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.3278688524590163) internal successors, (142), 61 states have internal predecessors, (142), 0 states have call successors, (0), 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 51 [2022-07-14 06:29:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:29:11,452 INFO L225 Difference]: With dead ends: 448 [2022-07-14 06:29:11,452 INFO L226 Difference]: Without dead ends: 448 [2022-07-14 06:29:11,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=478, Invalid=4330, Unknown=38, NotChecked=556, Total=5402 [2022-07-14 06:29:11,453 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 151 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 969 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:29:11,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 966 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 754 Invalid, 0 Unknown, 969 Unchecked, 0.4s Time] [2022-07-14 06:29:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-07-14 06:29:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 403. [2022-07-14 06:29:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 391 states have (on average 1.2020460358056266) internal successors, (470), 402 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:29:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 470 transitions. [2022-07-14 06:29:11,458 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 470 transitions. Word has length 51 [2022-07-14 06:29:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:29:11,458 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 470 transitions. [2022-07-14 06:29:11,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.3278688524590163) internal successors, (142), 61 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:29:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 470 transitions. [2022-07-14 06:29:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:29:11,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:29:11,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:29:11,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-07-14 06:29:11,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:29:11,675 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-07-14 06:29:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:29:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1787250958, now seen corresponding path program 3 times [2022-07-14 06:29:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:29:11,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712118434] [2022-07-14 06:29:11,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:29:11,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:29:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:29:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:29:12,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:29:12,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712118434] [2022-07-14 06:29:12,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712118434] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:29:12,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049761744] [2022-07-14 06:29:12,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:29:12,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:29:12,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:29:12,192 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:29:12,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-14 06:29:12,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-14 06:29:12,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:29:12,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-14 06:29:12,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:29:12,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:29:12,566 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:29:12,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:29:12,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:29:12,722 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:29:12,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:29:12,789 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:29:12,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:29:12,840 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 06:29:12,841 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 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-14 06:29:12,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:29:12,870 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-14 06:29:12,870 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 22 treesize of output 33 [2022-07-14 06:29:12,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:29:12,966 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 06:29:12,966 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 1 case distinctions, treesize of input 38 treesize of output 29 [2022-07-14 06:29:13,032 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 27 treesize of output 7 [2022-07-14 06:29:13,220 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:29:13,220 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 111 treesize of output 87 [2022-07-14 06:29:13,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:29:13,304 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:29:13,304 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 156 treesize of output 117 [2022-07-14 06:29:13,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2022-07-14 06:29:13,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-14 06:29:13,823 INFO L356 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-07-14 06:29:13,823 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 116 treesize of output 56 [2022-07-14 06:29:13,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-14 06:29:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:29:13,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:29:14,268 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 107 treesize of output 94 [2022-07-14 06:29:14,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3801 (Array Int Int)) (v_ArrVal_3792 Int) (|v_ULTIMATE.start_main_~t~0#1.base_99| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_317| Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) |v_ULTIMATE.start_main_~t~0#1.base_99|)) |v_ULTIMATE.start_main_~t~0#1.base_99| v_ArrVal_3801))) (let ((.cse0 (store |c_#length| |v_ULTIMATE.start_main_~t~0#1.base_99| v_ArrVal_3792)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (< 12 v_ArrVal_3792) (not (<= (+ 12 |v_ULTIMATE.start_main_~p~0#1.offset_317|) (select .cse0 .cse1))) (= |v_ULTIMATE.start_main_~t~0#1.base_99| .cse1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_317|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_99|) 0)) (< (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 12)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_99| 1) (select (select .cse2 .cse1) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_317|))) 1))))) is different from false [2022-07-14 06:29:14,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:29:14,983 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 91 treesize of output 79 [2022-07-14 06:29:15,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:29:15,427 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 139 treesize of output 109 [2022-07-14 06:29:15,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:29:15,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1463 treesize of output 1442 [2022-07-14 06:29:15,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:29:15,527 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 1363 treesize of output 975 [2022-07-14 06:29:15,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:29:15,547 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 935 treesize of output 739