./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:12,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:12,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:12,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:12,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:12,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:12,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:12,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:12,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:12,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:12,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:12,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:12,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:12,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:12,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:12,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:12,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:12,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:12,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:12,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:12,214 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:12,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:12,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:12,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:12,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:12,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:12,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:12,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:12,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:12,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:12,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:12,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:12,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:12,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:12,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:12,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:12,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:12,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:12,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:12,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:12,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:12,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:12,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-14 05:50:12,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:12,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:12,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:12,269 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:12,270 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:12,270 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:12,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:12,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:12,271 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:12,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:12,272 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:12,272 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:12,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:12,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:12,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:12,273 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:12,273 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:12,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:12,274 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:12,274 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:12,274 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:12,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:12,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:12,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:12,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:12,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:12,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:12,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:50:12,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:50:12,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2022-07-14 05:50:12,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:12,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:12,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:12,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:12,541 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:12,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2022-07-14 05:50:12,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5746e9a14/25ab7a4dad6f4ede9d2292e5811a84dd/FLAGdfbf22a8b [2022-07-14 05:50:13,027 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:13,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2022-07-14 05:50:13,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5746e9a14/25ab7a4dad6f4ede9d2292e5811a84dd/FLAGdfbf22a8b [2022-07-14 05:50:13,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5746e9a14/25ab7a4dad6f4ede9d2292e5811a84dd [2022-07-14 05:50:13,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:13,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:13,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:13,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:13,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:13,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aab1681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13, skipping insertion in model container [2022-07-14 05:50:13,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:13,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:13,538 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/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2022-07-14 05:50:13,559 WARN L570 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2022-07-14 05:50:13,561 WARN L570 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2022-07-14 05:50:13,562 WARN L570 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2022-07-14 05:50:13,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:13,616 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-14 05:50:13,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@78e9858f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13, skipping insertion in model container [2022-07-14 05:50:13,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:13,618 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 05:50:13,621 INFO L158 Benchmark]: Toolchain (without parser) took 557.23ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 63.0MB in the beginning and 88.0MB in the end (delta: -25.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 05:50:13,622 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:50:13,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.94ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 62.8MB in the beginning and 88.0MB in the end (delta: -25.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 05:50:13,625 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.94ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 62.8MB in the beginning and 88.0MB in the end (delta: -25.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:15,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:15,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:15,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:15,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:15,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:15,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:15,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:15,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:15,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:15,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:15,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:15,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:15,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:15,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:15,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:15,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:15,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:15,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:15,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:15,692 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:15,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:15,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:15,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:15,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:15,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:15,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:15,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:15,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:15,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:15,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:15,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:15,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:15,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:15,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:15,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:15,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:15,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:15,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:15,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:15,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:15,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:15,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-07-14 05:50:15,755 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:15,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:15,756 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:15,756 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:15,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:15,757 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:15,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:15,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:15,758 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:15,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:15,759 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:15,759 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:15,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:15,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:15,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:15,760 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:15,760 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:15,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:15,761 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:15,761 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 05:50:15,761 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 05:50:15,761 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:15,761 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:15,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:15,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:15,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:15,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:15,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:15,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:15,763 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 05:50:15,763 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:15,763 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 05:50:15,763 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2022-07-14 05:50:16,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:16,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:16,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:16,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:16,150 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:16,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2022-07-14 05:50:16,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448ab8ce2/8bdc3d4ba2b64fa08c974c63560912a4/FLAGa59bd2b38 [2022-07-14 05:50:16,858 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:16,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2022-07-14 05:50:16,880 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448ab8ce2/8bdc3d4ba2b64fa08c974c63560912a4/FLAGa59bd2b38 [2022-07-14 05:50:17,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448ab8ce2/8bdc3d4ba2b64fa08c974c63560912a4 [2022-07-14 05:50:17,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:17,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:17,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:17,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:17,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:17,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:17,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4ae11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17, skipping insertion in model container [2022-07-14 05:50:17,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:17,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:17,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:17,636 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/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2022-07-14 05:50:17,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:17,725 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 05:50:17,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:17,766 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/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2022-07-14 05:50:17,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:17,800 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:50:17,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2022-07-14 05:50:17,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:17,941 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:50:17,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17 WrapperNode [2022-07-14 05:50:17,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:17,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:17,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:50:17,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:50:17,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:17,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:18,024 INFO L137 Inliner]: procedures = 235, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2022-07-14 05:50:18,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:18,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:50:18,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:50:18,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:50:18,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:18,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:18,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:18,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:18,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:18,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:18,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:18,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:50:18,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:50:18,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:50:18,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:50:18,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (1/1) ... [2022-07-14 05:50:18,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:18,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:18,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 05:50:18,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 05:50:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 05:50:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:50:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2022-07-14 05:50:18,178 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2022-07-14 05:50:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:50:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 05:50:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 05:50:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 05:50:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2022-07-14 05:50:18,179 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2022-07-14 05:50:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-14 05:50:18,179 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-14 05:50:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:50:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:50:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:50:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-14 05:50:18,180 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-14 05:50:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:50:18,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:50:18,332 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:50:18,334 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:50:19,147 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:50:19,153 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:50:19,154 INFO L299 CfgBuilder]: Removed 41 assume(true) statements. [2022-07-14 05:50:19,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:19 BoogieIcfgContainer [2022-07-14 05:50:19,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:50:19,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:50:19,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:50:19,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:50:19,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:50:17" (1/3) ... [2022-07-14 05:50:19,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4df255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:19, skipping insertion in model container [2022-07-14 05:50:19,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:17" (2/3) ... [2022-07-14 05:50:19,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4df255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:19, skipping insertion in model container [2022-07-14 05:50:19,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:19" (3/3) ... [2022-07-14 05:50:19,163 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2022-07-14 05:50:19,174 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:50:19,174 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2022-07-14 05:50:19,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:50:19,231 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@cfd10ea, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3052c46d [2022-07-14 05:50:19,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2022-07-14 05:50:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 117 states have (on average 2.1623931623931623) internal successors, (253), 206 states have internal predecessors, (253), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-14 05:50:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 05:50:19,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:19,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 05:50:19,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:19,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash 378924727, now seen corresponding path program 1 times [2022-07-14 05:50:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:19,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987003995] [2022-07-14 05:50:19,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:19,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:19,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:19,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 05:50:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-14 05:50:19,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:19,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:19,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:19,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987003995] [2022-07-14 05:50:19,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987003995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:19,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:19,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:19,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066327911] [2022-07-14 05:50:19,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:19,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 05:50:19,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 05:50:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 05:50:19,392 INFO L87 Difference]: Start difference. First operand has 216 states, 117 states have (on average 2.1623931623931623) internal successors, (253), 206 states have internal predecessors, (253), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:19,446 INFO L93 Difference]: Finished difference Result 212 states and 234 transitions. [2022-07-14 05:50:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 05:50:19,449 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 05:50:19,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:19,463 INFO L225 Difference]: With dead ends: 212 [2022-07-14 05:50:19,463 INFO L226 Difference]: Without dead ends: 210 [2022-07-14 05:50:19,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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 05:50:19,468 INFO L413 NwaCegarLoop]: 234 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, 234 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 05:50:19,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-14 05:50:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-07-14 05:50:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 115 states have (on average 1.7826086956521738) internal successors, (205), 199 states have internal predecessors, (205), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 05:50:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 232 transitions. [2022-07-14 05:50:19,538 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 232 transitions. Word has length 5 [2022-07-14 05:50:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:19,539 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 232 transitions. [2022-07-14 05:50:19,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 232 transitions. [2022-07-14 05:50:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 05:50:19,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:19,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 05:50:19,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-14 05:50:19,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:19,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:19,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash 378924789, now seen corresponding path program 1 times [2022-07-14 05:50:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:19,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647591784] [2022-07-14 05:50:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:19,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:19,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:19,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 05:50:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 05:50:19,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:19,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:19,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:19,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:19,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647591784] [2022-07-14 05:50:19,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647591784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:19,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:19,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:19,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169102389] [2022-07-14 05:50:19,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:19,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:19,899 INFO L87 Difference]: Start difference. First operand 210 states and 232 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:20,179 INFO L93 Difference]: Finished difference Result 229 states and 251 transitions. [2022-07-14 05:50:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 05:50:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:20,181 INFO L225 Difference]: With dead ends: 229 [2022-07-14 05:50:20,181 INFO L226 Difference]: Without dead ends: 229 [2022-07-14 05:50:20,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:20,183 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 69 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:20,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 314 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-14 05:50:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 207. [2022-07-14 05:50:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 115 states have (on average 1.7565217391304349) internal successors, (202), 196 states have internal predecessors, (202), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 05:50:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 229 transitions. [2022-07-14 05:50:20,195 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 229 transitions. Word has length 5 [2022-07-14 05:50:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:20,195 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 229 transitions. [2022-07-14 05:50:20,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 229 transitions. [2022-07-14 05:50:20,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 05:50:20,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:20,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 05:50:20,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:20,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:20,404 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash 378924790, now seen corresponding path program 1 times [2022-07-14 05:50:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:20,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169153130] [2022-07-14 05:50:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:20,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:20,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:20,410 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:20,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 05:50:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:20,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 05:50:20,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:20,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:20,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:20,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:20,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169153130] [2022-07-14 05:50:20,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169153130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:20,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:20,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:20,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400698997] [2022-07-14 05:50:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:20,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:20,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:20,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:20,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:20,587 INFO L87 Difference]: Start difference. First operand 207 states and 229 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:20,920 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2022-07-14 05:50:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:20,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 05:50:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:20,922 INFO L225 Difference]: With dead ends: 205 [2022-07-14 05:50:20,922 INFO L226 Difference]: Without dead ends: 205 [2022-07-14 05:50:20,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:20,923 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 67 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:20,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 306 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-14 05:50:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2022-07-14 05:50:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 115 states have (on average 1.7304347826086957) internal successors, (199), 193 states have internal predecessors, (199), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 05:50:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 226 transitions. [2022-07-14 05:50:20,933 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 226 transitions. Word has length 5 [2022-07-14 05:50:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:20,933 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 226 transitions. [2022-07-14 05:50:20,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 226 transitions. [2022-07-14 05:50:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 05:50:20,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:20,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:20,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:21,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:21,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1374843154, now seen corresponding path program 1 times [2022-07-14 05:50:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:21,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027858099] [2022-07-14 05:50:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:21,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:21,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:21,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:21,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 05:50:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:21,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 05:50:21,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:21,291 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 05:50:21,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-14 05:50:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:21,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:21,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:21,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027858099] [2022-07-14 05:50:21,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027858099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:21,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:21,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:21,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400300117] [2022-07-14 05:50:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:21,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:21,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:21,365 INFO L87 Difference]: Start difference. First operand 204 states and 226 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:21,804 INFO L93 Difference]: Finished difference Result 241 states and 262 transitions. [2022-07-14 05:50:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:21,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 05:50:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:21,806 INFO L225 Difference]: With dead ends: 241 [2022-07-14 05:50:21,806 INFO L226 Difference]: Without dead ends: 241 [2022-07-14 05:50:21,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 05:50:21,807 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 269 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:21,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 399 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 05:50:21,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-14 05:50:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 218. [2022-07-14 05:50:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 129 states have (on average 1.751937984496124) internal successors, (226), 206 states have internal predecessors, (226), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 05:50:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 253 transitions. [2022-07-14 05:50:21,819 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 253 transitions. Word has length 8 [2022-07-14 05:50:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:21,819 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 253 transitions. [2022-07-14 05:50:21,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 253 transitions. [2022-07-14 05:50:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 05:50:21,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:21,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:21,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:22,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:22,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:22,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1374843155, now seen corresponding path program 1 times [2022-07-14 05:50:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:22,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450396524] [2022-07-14 05:50:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:22,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:22,037 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:22,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 05:50:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:22,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 05:50:22,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:22,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:22,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 05:50:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:22,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:22,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:22,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450396524] [2022-07-14 05:50:22,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450396524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:22,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:22,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129871900] [2022-07-14 05:50:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:22,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:22,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:22,303 INFO L87 Difference]: Start difference. First operand 218 states and 253 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:22,969 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2022-07-14 05:50:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:22,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 05:50:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:22,971 INFO L225 Difference]: With dead ends: 222 [2022-07-14 05:50:22,971 INFO L226 Difference]: Without dead ends: 222 [2022-07-14 05:50:22,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:22,972 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 267 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:22,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 310 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 05:50:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-14 05:50:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 210. [2022-07-14 05:50:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 125 states have (on average 1.696) internal successors, (212), 198 states have internal predecessors, (212), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 05:50:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 239 transitions. [2022-07-14 05:50:22,978 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 239 transitions. Word has length 8 [2022-07-14 05:50:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:22,979 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 239 transitions. [2022-07-14 05:50:22,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 239 transitions. [2022-07-14 05:50:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:50:22,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:22,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:22,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:23,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:23,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:23,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:23,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1625645901, now seen corresponding path program 1 times [2022-07-14 05:50:23,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:23,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057126599] [2022-07-14 05:50:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:23,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:23,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:23,183 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:23,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 05:50:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:23,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 05:50:23,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:23,358 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-14 05:50:23,359 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 17 treesize of output 15 [2022-07-14 05:50:23,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:23,466 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 05:50:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:23,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:23,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:23,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057126599] [2022-07-14 05:50:23,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057126599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:23,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:23,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200195416] [2022-07-14 05:50:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:23,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:50:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:50:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:23,505 INFO L87 Difference]: Start difference. First operand 210 states and 239 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:24,100 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2022-07-14 05:50:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:50:24,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 05:50:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:24,103 INFO L225 Difference]: With dead ends: 231 [2022-07-14 05:50:24,103 INFO L226 Difference]: Without dead ends: 231 [2022-07-14 05:50:24,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-14 05:50:24,104 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 41 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:24,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1039 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 05:50:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-14 05:50:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2022-07-14 05:50:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 137 states have (on average 1.686131386861314) internal successors, (231), 211 states have internal predecessors, (231), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:50:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 260 transitions. [2022-07-14 05:50:24,110 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 260 transitions. Word has length 10 [2022-07-14 05:50:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:24,110 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 260 transitions. [2022-07-14 05:50:24,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 260 transitions. [2022-07-14 05:50:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:50:24,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:24,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:24,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:24,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:24,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:24,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:24,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1625645900, now seen corresponding path program 1 times [2022-07-14 05:50:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:24,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107095288] [2022-07-14 05:50:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:24,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:24,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:24,324 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:24,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 05:50:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:24,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 05:50:24,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:24,646 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:24,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 05:50:24,663 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:24,664 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 12 treesize of output 12 [2022-07-14 05:50:24,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:24,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:24,875 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 05:50:24,889 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 05:50:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:24,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:24,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:24,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107095288] [2022-07-14 05:50:24,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107095288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:24,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:24,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:24,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606541542] [2022-07-14 05:50:24,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:24,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:50:24,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:24,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:50:24,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:24,933 INFO L87 Difference]: Start difference. First operand 224 states and 260 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:25,830 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2022-07-14 05:50:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:50:25,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 05:50:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:25,831 INFO L225 Difference]: With dead ends: 230 [2022-07-14 05:50:25,831 INFO L226 Difference]: Without dead ends: 230 [2022-07-14 05:50:25,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-14 05:50:25,832 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 47 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:25,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 971 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 05:50:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-14 05:50:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2022-07-14 05:50:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 137 states have (on average 1.6788321167883211) internal successors, (230), 211 states have internal predecessors, (230), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:50:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 259 transitions. [2022-07-14 05:50:25,858 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 259 transitions. Word has length 10 [2022-07-14 05:50:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:25,858 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 259 transitions. [2022-07-14 05:50:25,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 259 transitions. [2022-07-14 05:50:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:50:25,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:25,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:25,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:26,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:26,070 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:26,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1144584946, now seen corresponding path program 1 times [2022-07-14 05:50:26,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:26,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180791378] [2022-07-14 05:50:26,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:26,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:26,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:26,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 05:50:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 05:50:26,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:26,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:26,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:26,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:26,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180791378] [2022-07-14 05:50:26,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180791378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:26,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:26,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:26,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300931024] [2022-07-14 05:50:26,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:26,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:26,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:26,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:26,254 INFO L87 Difference]: Start difference. First operand 224 states and 259 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:26,689 INFO L93 Difference]: Finished difference Result 245 states and 270 transitions. [2022-07-14 05:50:26,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:26,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 05:50:26,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:26,691 INFO L225 Difference]: With dead ends: 245 [2022-07-14 05:50:26,691 INFO L226 Difference]: Without dead ends: 245 [2022-07-14 05:50:26,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:26,692 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 105 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:26,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 703 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 05:50:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-14 05:50:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 223. [2022-07-14 05:50:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 137 states have (on average 1.6423357664233578) internal successors, (225), 210 states have internal predecessors, (225), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:50:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 254 transitions. [2022-07-14 05:50:26,698 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 254 transitions. Word has length 11 [2022-07-14 05:50:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:26,698 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 254 transitions. [2022-07-14 05:50:26,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 254 transitions. [2022-07-14 05:50:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:50:26,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:26,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:26,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:26,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:26,909 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:26,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:26,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1144584947, now seen corresponding path program 1 times [2022-07-14 05:50:26,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:26,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249017154] [2022-07-14 05:50:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:26,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:26,911 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:26,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 05:50:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 05:50:26,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:27,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:27,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:27,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:27,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249017154] [2022-07-14 05:50:27,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249017154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:27,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:27,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157461544] [2022-07-14 05:50:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:27,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:27,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:27,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:27,083 INFO L87 Difference]: Start difference. First operand 223 states and 254 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:27,601 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2022-07-14 05:50:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:27,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 05:50:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:27,603 INFO L225 Difference]: With dead ends: 227 [2022-07-14 05:50:27,603 INFO L226 Difference]: Without dead ends: 227 [2022-07-14 05:50:27,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:27,603 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 94 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:27,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 719 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 05:50:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-14 05:50:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2022-07-14 05:50:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 210 states have internal predecessors, (221), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:50:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 250 transitions. [2022-07-14 05:50:27,610 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 250 transitions. Word has length 11 [2022-07-14 05:50:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:27,611 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 250 transitions. [2022-07-14 05:50:27,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 250 transitions. [2022-07-14 05:50:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 05:50:27,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:27,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:27,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:27,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:27,835 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash 434515829, now seen corresponding path program 1 times [2022-07-14 05:50:27,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:27,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768239295] [2022-07-14 05:50:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:27,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:27,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:27,840 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:27,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 05:50:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:27,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 05:50:27,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:28,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:28,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:28,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768239295] [2022-07-14 05:50:28,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768239295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:28,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:28,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:28,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492369963] [2022-07-14 05:50:28,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:28,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:50:28,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:28,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:50:28,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:50:28,003 INFO L87 Difference]: Start difference. First operand 223 states and 250 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:28,181 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2022-07-14 05:50:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:50:28,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 05:50:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:28,182 INFO L225 Difference]: With dead ends: 222 [2022-07-14 05:50:28,182 INFO L226 Difference]: Without dead ends: 222 [2022-07-14 05:50:28,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:28,183 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 22 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:28,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 499 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-14 05:50:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-07-14 05:50:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 137 states have (on average 1.5912408759124088) internal successors, (218), 209 states have internal predecessors, (218), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:50:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 247 transitions. [2022-07-14 05:50:28,191 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 247 transitions. Word has length 13 [2022-07-14 05:50:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:28,191 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 247 transitions. [2022-07-14 05:50:28,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 247 transitions. [2022-07-14 05:50:28,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 05:50:28,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:28,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:28,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:28,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:28,402 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:28,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash 434515830, now seen corresponding path program 1 times [2022-07-14 05:50:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:28,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140100500] [2022-07-14 05:50:28,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:28,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:28,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:28,405 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:28,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 05:50:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:28,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 05:50:28,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:28,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:28,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:28,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140100500] [2022-07-14 05:50:28,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140100500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:28,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:28,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593745003] [2022-07-14 05:50:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:28,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:28,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:28,569 INFO L87 Difference]: Start difference. First operand 222 states and 247 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:29,026 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2022-07-14 05:50:29,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:29,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 05:50:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:29,029 INFO L225 Difference]: With dead ends: 224 [2022-07-14 05:50:29,029 INFO L226 Difference]: Without dead ends: 224 [2022-07-14 05:50:29,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:50:29,030 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 250 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:29,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 917 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 05:50:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-14 05:50:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2022-07-14 05:50:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 137 states have (on average 1.5766423357664234) internal successors, (216), 209 states have internal predecessors, (216), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:50:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 245 transitions. [2022-07-14 05:50:29,036 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 245 transitions. Word has length 13 [2022-07-14 05:50:29,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:29,037 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 245 transitions. [2022-07-14 05:50:29,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 245 transitions. [2022-07-14 05:50:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 05:50:29,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:29,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:29,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:29,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:29,248 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash 853908818, now seen corresponding path program 1 times [2022-07-14 05:50:29,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:29,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254327761] [2022-07-14 05:50:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:29,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:29,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:29,250 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:29,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 05:50:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:29,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 05:50:29,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:29,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:29,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:29,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254327761] [2022-07-14 05:50:29,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254327761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:29,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:29,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:29,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971429154] [2022-07-14 05:50:29,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:29,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:29,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:29,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:29,408 INFO L87 Difference]: Start difference. First operand 222 states and 245 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:29,556 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2022-07-14 05:50:29,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:29,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-14 05:50:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:29,558 INFO L225 Difference]: With dead ends: 221 [2022-07-14 05:50:29,558 INFO L226 Difference]: Without dead ends: 221 [2022-07-14 05:50:29,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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 05:50:29,559 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 297 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:29,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 453 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:29,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-14 05:50:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-07-14 05:50:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 208 states have internal predecessors, (215), 21 states have call successors, (21), 6 states have call predecessors, (21), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:50:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2022-07-14 05:50:29,566 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 27 [2022-07-14 05:50:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:29,567 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 243 transitions. [2022-07-14 05:50:29,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 243 transitions. [2022-07-14 05:50:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 05:50:29,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:29,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:29,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:29,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:29,769 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting inspectErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash 853896473, now seen corresponding path program 1 times [2022-07-14 05:50:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:29,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763880148] [2022-07-14 05:50:29,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:29,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:29,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:29,788 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:29,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 05:50:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:29,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 05:50:29,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:30,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:30,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:30,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763880148] [2022-07-14 05:50:30,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763880148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:30,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:30,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:30,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730443444] [2022-07-14 05:50:30,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:30,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:30,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:30,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:30,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:30,035 INFO L87 Difference]: Start difference. First operand 221 states and 243 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:30,722 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2022-07-14 05:50:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:30,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-14 05:50:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:30,724 INFO L225 Difference]: With dead ends: 216 [2022-07-14 05:50:30,724 INFO L226 Difference]: Without dead ends: 216 [2022-07-14 05:50:30,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:50:30,725 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 381 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:30,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 424 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 05:50:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-14 05:50:30,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-14 05:50:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.532846715328467) internal successors, (210), 203 states have internal predecessors, (210), 21 states have call successors, (21), 6 states have call predecessors, (21), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:50:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 238 transitions. [2022-07-14 05:50:30,731 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 238 transitions. Word has length 27 [2022-07-14 05:50:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:30,731 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 238 transitions. [2022-07-14 05:50:30,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 238 transitions. [2022-07-14 05:50:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 05:50:30,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:30,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:30,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:30,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:30,933 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting inspectErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:30,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:30,933 INFO L85 PathProgramCache]: Analyzing trace with hash 853896474, now seen corresponding path program 1 times [2022-07-14 05:50:30,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:30,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835571570] [2022-07-14 05:50:30,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:30,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:30,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:30,936 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:30,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 05:50:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:31,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 05:50:31,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:31,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:31,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:31,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835571570] [2022-07-14 05:50:31,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835571570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:31,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:31,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814213505] [2022-07-14 05:50:31,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:31,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:50:31,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:31,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:50:31,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:31,225 INFO L87 Difference]: Start difference. First operand 216 states and 238 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:32,107 INFO L93 Difference]: Finished difference Result 215 states and 237 transitions. [2022-07-14 05:50:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:32,107 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-14 05:50:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:32,108 INFO L225 Difference]: With dead ends: 215 [2022-07-14 05:50:32,108 INFO L226 Difference]: Without dead ends: 215 [2022-07-14 05:50:32,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-14 05:50:32,109 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 492 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:32,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 480 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 05:50:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-14 05:50:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-07-14 05:50:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 137 states have (on average 1.5255474452554745) internal successors, (209), 202 states have internal predecessors, (209), 21 states have call successors, (21), 6 states have call predecessors, (21), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:50:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 237 transitions. [2022-07-14 05:50:32,115 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 237 transitions. Word has length 27 [2022-07-14 05:50:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:32,116 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 237 transitions. [2022-07-14 05:50:32,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 237 transitions. [2022-07-14 05:50:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 05:50:32,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:32,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:32,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-14 05:50:32,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:32,323 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:32,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash -661448180, now seen corresponding path program 1 times [2022-07-14 05:50:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:32,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843700950] [2022-07-14 05:50:32,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:32,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:32,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:32,326 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:32,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 05:50:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:32,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 05:50:32,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:32,672 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:32,673 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 12 treesize of output 12 [2022-07-14 05:50:32,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:32,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:32,930 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:32,931 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 19 treesize of output 22 [2022-07-14 05:50:33,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:33,014 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 16 treesize of output 11 [2022-07-14 05:50:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:33,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:33,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:33,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843700950] [2022-07-14 05:50:33,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843700950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:33,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:33,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 05:50:33,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796373599] [2022-07-14 05:50:33,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:33,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 05:50:33,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:33,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 05:50:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-14 05:50:33,063 INFO L87 Difference]: Start difference. First operand 215 states and 237 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:34,392 INFO L93 Difference]: Finished difference Result 360 states and 397 transitions. [2022-07-14 05:50:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 05:50:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-14 05:50:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:34,397 INFO L225 Difference]: With dead ends: 360 [2022-07-14 05:50:34,399 INFO L226 Difference]: Without dead ends: 360 [2022-07-14 05:50:34,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-07-14 05:50:34,402 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 986 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:34,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 991 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-14 05:50:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-14 05:50:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294. [2022-07-14 05:50:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 211 states have (on average 1.5545023696682465) internal successors, (328), 277 states have internal predecessors, (328), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 05:50:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 362 transitions. [2022-07-14 05:50:34,419 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 362 transitions. Word has length 30 [2022-07-14 05:50:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:34,420 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 362 transitions. [2022-07-14 05:50:34,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 362 transitions. [2022-07-14 05:50:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 05:50:34,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:34,423 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] [2022-07-14 05:50:34,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:34,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:34,636 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash -662300209, now seen corresponding path program 1 times [2022-07-14 05:50:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:34,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470125489] [2022-07-14 05:50:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:34,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:34,639 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:34,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 05:50:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:34,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-14 05:50:34,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:34,901 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:50:34,901 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 18 treesize of output 25 [2022-07-14 05:50:35,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:35,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:35,318 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:35,318 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 31 treesize of output 32 [2022-07-14 05:50:35,410 INFO L356 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2022-07-14 05:50:35,410 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 34 treesize of output 55 [2022-07-14 05:50:35,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 36 treesize of output 34 [2022-07-14 05:50:35,692 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 37 treesize of output 21 [2022-07-14 05:50:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:35,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:35,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_16| (_ BitVec 32))) (or (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_16| v_ArrVal_493) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (not (= (bvneg (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_16|)) (_ bv0 1))))) is different from false [2022-07-14 05:50:35,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_16| (_ BitVec 32)) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (bvneg (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_16|)) (_ bv0 1))) (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_16| (_ bv1 1)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_491) |v_ULTIMATE.start_gl_insert_~node~1#1.base_16| v_ArrVal_493) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2022-07-14 05:50:36,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:36,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 05:50:36,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:36,188 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 32 [2022-07-14 05:50:36,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-14 05:50:36,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:36,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470125489] [2022-07-14 05:50:36,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470125489] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:36,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1546133791] [2022-07-14 05:50:36,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:36,299 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:36,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:50:36,303 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:50:36,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-07-14 05:50:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:36,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 05:50:36,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:36,958 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-14 05:50:36,958 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 23 treesize of output 40 [2022-07-14 05:50:37,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:37,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:37,984 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:37,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-07-14 05:50:38,160 INFO L356 Elim1Store]: treesize reduction 57, result has 44.1 percent of original size [2022-07-14 05:50:38,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 72 [2022-07-14 05:50:38,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2022-07-14 05:50:38,493 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 36 treesize of output 20 [2022-07-14 05:50:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:38,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:38,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_19| (_ BitVec 32)) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (_ BitVec 1))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_19|)))) (= (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_19| v_ArrVal_571) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_19| v_ArrVal_493) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1)))) is different from false [2022-07-14 05:50:38,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_19| (_ BitVec 32)) (v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (_ BitVec 1))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_19|)))) (= (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_19| v_ArrVal_571) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_570) |v_ULTIMATE.start_gl_insert_~node~1#1.base_19| v_ArrVal_493) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1)))) is different from false [2022-07-14 05:50:38,850 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:38,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 05:50:38,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:38,855 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 32 [2022-07-14 05:50:38,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-14 05:50:41,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1546133791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:41,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:41,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 29 [2022-07-14 05:50:41,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068712756] [2022-07-14 05:50:41,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:41,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 05:50:41,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:41,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 05:50:41,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1293, Unknown=7, NotChecked=308, Total=1806 [2022-07-14 05:50:41,005 INFO L87 Difference]: Start difference. First operand 294 states and 362 transitions. Second operand has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 05:50:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:42,109 INFO L93 Difference]: Finished difference Result 334 states and 398 transitions. [2022-07-14 05:50:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 05:50:42,110 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-07-14 05:50:42,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:42,112 INFO L225 Difference]: With dead ends: 334 [2022-07-14 05:50:42,112 INFO L226 Difference]: Without dead ends: 334 [2022-07-14 05:50:42,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=290, Invalid=1699, Unknown=7, NotChecked=356, Total=2352 [2022-07-14 05:50:42,113 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 176 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:42,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1989 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 486 Invalid, 0 Unknown, 674 Unchecked, 0.7s Time] [2022-07-14 05:50:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-07-14 05:50:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 294. [2022-07-14 05:50:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 211 states have (on average 1.5497630331753554) internal successors, (327), 277 states have internal predecessors, (327), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 05:50:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 361 transitions. [2022-07-14 05:50:42,121 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 361 transitions. Word has length 29 [2022-07-14 05:50:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:42,122 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 361 transitions. [2022-07-14 05:50:42,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 05:50:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 361 transitions. [2022-07-14 05:50:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 05:50:42,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:42,123 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] [2022-07-14 05:50:42,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:42,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:42,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:42,528 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:50:42,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash -662300208, now seen corresponding path program 1 times [2022-07-14 05:50:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:42,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151218632] [2022-07-14 05:50:42,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:42,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:42,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:42,544 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:42,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 05:50:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-14 05:50:42,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:42,839 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:42,839 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 12 treesize of output 12 [2022-07-14 05:50:42,845 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 05:50:43,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:43,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:43,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:43,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:43,351 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:43,352 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 38 treesize of output 37 [2022-07-14 05:50:43,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 05:50:43,450 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:43,451 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 14 treesize of output 14 [2022-07-14 05:50:43,476 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 05:50:43,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:50:43,534 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 05:50:43,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:43,645 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 05:50:43,648 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 05:50:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:43,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:44,019 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_656) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_655) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_656) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-07-14 05:50:44,095 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_22| (_ BitVec 32))) (or (and (forall ((v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_22| v_ArrVal_656) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_22| v_ArrVal_656) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~1#1.base_22| (_ bv20 32)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_22| v_ArrVal_655) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_22|)))))) is different from false [2022-07-14 05:50:44,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_22| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_22|)))) (and (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_653) |v_ULTIMATE.start_gl_insert_~node~1#1.base_22| v_ArrVal_656) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~1#1.base_22| (_ bv20 32)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_652) |v_ULTIMATE.start_gl_insert_~node~1#1.base_22| v_ArrVal_655) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_653) |v_ULTIMATE.start_gl_insert_~node~1#1.base_22| v_ArrVal_656) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32)))))))) is different from false [2022-07-14 05:50:45,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:45,224 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 48 treesize of output 49 [2022-07-14 05:50:45,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:45,246 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 38 treesize of output 39 [2022-07-14 05:50:45,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:45,255 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 64 treesize of output 56 [2022-07-14 05:50:45,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:45,261 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 96 treesize of output 84 [2022-07-14 05:50:45,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 36 [2022-07-14 05:50:45,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 70 [2022-07-14 05:50:45,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:45,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 47 treesize of output 38 [2022-07-14 05:50:45,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:45,425 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 46 treesize of output 34 [2022-07-14 05:50:45,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 11 [2022-07-14 05:50:45,447 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:50:45,447 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 14 treesize of output 13 [2022-07-14 05:50:45,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:45,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151218632] [2022-07-14 05:50:45,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151218632] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:45,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [478233706] [2022-07-14 05:50:45,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:45,779 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:45,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:50:45,780 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:50:45,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-14 05:50:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:46,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-14 05:50:46,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:46,385 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:50:46,385 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 18 treesize of output 25 [2022-07-14 05:50:46,397 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 05:50:47,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 11 treesize of output 7 [2022-07-14 05:50:47,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:47,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:47,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:47,699 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:47,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2022-07-14 05:50:47,705 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 05:50:47,901 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-14 05:50:47,902 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 28 treesize of output 30 [2022-07-14 05:50:47,918 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 05:50:48,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 05:50:48,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:48,286 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 05:50:48,292 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 05:50:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:48,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:48,388 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_744 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_744) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2022-07-14 05:50:55,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_742 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_25| (_ BitVec 32))) (or (not (= (bvneg (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25|)) (_ bv0 1))) (and (forall ((v_ArrVal_743 (_ BitVec 32)) (v_ArrVal_744 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_741) |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_743) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_742) |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_744) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_741) |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))))) is different from false [2022-07-14 05:50:56,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_25| (_ BitVec 32))) (or (and (forall ((v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_743 (_ BitVec 32)) (v_ArrVal_744 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_741) |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_743) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_742) |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_744) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_741) |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (not (= (bvneg (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25|)) (_ bv0 1))))) is different from false [2022-07-14 05:50:56,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:56,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, 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 38 [2022-07-14 05:50:56,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:56,615 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 46 treesize of output 34 [2022-07-14 05:50:56,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 11 [2022-07-14 05:50:56,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:56,653 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 48 treesize of output 49 [2022-07-14 05:50:56,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:56,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:56,662 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 43 treesize of output 35 [2022-07-14 05:50:56,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:56,677 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 30 treesize of output 31 [2022-07-14 05:50:56,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:56,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:56,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-14 05:50:56,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [478233706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:56,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:56,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-07-14 05:50:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778877266] [2022-07-14 05:50:56,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:56,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 05:50:56,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 05:50:56,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1301, Unknown=25, NotChecked=474, Total=1980 [2022-07-14 05:50:56,965 INFO L87 Difference]: Start difference. First operand 294 states and 361 transitions. Second operand has 30 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 05:50:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:59,639 INFO L93 Difference]: Finished difference Result 374 states and 411 transitions. [2022-07-14 05:50:59,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 05:50:59,640 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-07-14 05:50:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:59,641 INFO L225 Difference]: With dead ends: 374 [2022-07-14 05:50:59,642 INFO L226 Difference]: Without dead ends: 374 [2022-07-14 05:50:59,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=259, Invalid=1632, Unknown=25, NotChecked=534, Total=2450 [2022-07-14 05:50:59,643 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 963 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1673 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:59,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1883 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1349 Invalid, 0 Unknown, 1673 Unchecked, 2.1s Time] [2022-07-14 05:50:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-14 05:50:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 280. [2022-07-14 05:50:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 199 states have (on average 1.5778894472361809) internal successors, (314), 264 states have internal predecessors, (314), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 346 transitions. [2022-07-14 05:50:59,657 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 346 transitions. Word has length 29 [2022-07-14 05:50:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:59,657 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 346 transitions. [2022-07-14 05:50:59,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 05:50:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 346 transitions. [2022-07-14 05:50:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 05:50:59,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:59,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:59,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:59,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:00,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:00,068 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting inspectErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:00,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash -661459978, now seen corresponding path program 1 times [2022-07-14 05:51:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:00,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746125540] [2022-07-14 05:51:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:00,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:00,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:00,071 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:00,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 05:51:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:00,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 05:51:00,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:00,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:00,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 05:51:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:00,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:00,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:00,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746125540] [2022-07-14 05:51:00,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746125540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:00,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:00,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:51:00,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915484177] [2022-07-14 05:51:00,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:00,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:51:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:00,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:51:00,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:51:00,532 INFO L87 Difference]: Start difference. First operand 280 states and 346 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:01,175 INFO L93 Difference]: Finished difference Result 278 states and 342 transitions. [2022-07-14 05:51:01,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:51:01,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-14 05:51:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:01,177 INFO L225 Difference]: With dead ends: 278 [2022-07-14 05:51:01,177 INFO L226 Difference]: Without dead ends: 278 [2022-07-14 05:51:01,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:51:01,178 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 289 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:01,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 219 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 05:51:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-14 05:51:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-07-14 05:51:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 199 states have (on average 1.5577889447236182) internal successors, (310), 262 states have internal predecessors, (310), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:51:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2022-07-14 05:51:01,184 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 30 [2022-07-14 05:51:01,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:01,185 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2022-07-14 05:51:01,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2022-07-14 05:51:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 05:51:01,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:01,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:01,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:01,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:01,397 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:01,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:01,398 INFO L85 PathProgramCache]: Analyzing trace with hash -244243135, now seen corresponding path program 1 times [2022-07-14 05:51:01,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:01,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632650563] [2022-07-14 05:51:01,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:01,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:01,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:01,400 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:01,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 05:51:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:01,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-14 05:51:01,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:01,637 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:01,637 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 12 treesize of output 12 [2022-07-14 05:51:01,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:01,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 05:51:01,695 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 7 treesize of output 3 [2022-07-14 05:51:01,703 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 7 treesize of output 3 [2022-07-14 05:51:02,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:02,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2022-07-14 05:51:02,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:02,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-07-14 05:51:02,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 19 treesize of output 11 [2022-07-14 05:51:02,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:02,424 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 21 treesize of output 23 [2022-07-14 05:51:02,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:51:02,521 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:02,521 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 23 treesize of output 26 [2022-07-14 05:51:02,776 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 16 treesize of output 8 [2022-07-14 05:51:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:02,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:02,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:02,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632650563] [2022-07-14 05:51:02,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632650563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:02,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:02,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-14 05:51:02,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276084341] [2022-07-14 05:51:02,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:02,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 05:51:02,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 05:51:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=223, Unknown=15, NotChecked=0, Total=272 [2022-07-14 05:51:02,829 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:06,230 INFO L93 Difference]: Finished difference Result 452 states and 534 transitions. [2022-07-14 05:51:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 05:51:06,231 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-14 05:51:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:06,232 INFO L225 Difference]: With dead ends: 452 [2022-07-14 05:51:06,232 INFO L226 Difference]: Without dead ends: 452 [2022-07-14 05:51:06,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=94, Invalid=530, Unknown=26, NotChecked=0, Total=650 [2022-07-14 05:51:06,233 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 397 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 371 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:06,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1381 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1674 Invalid, 0 Unknown, 371 Unchecked, 2.7s Time] [2022-07-14 05:51:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-07-14 05:51:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 379. [2022-07-14 05:51:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.5273972602739727) internal successors, (446), 356 states have internal predecessors, (446), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:51:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 488 transitions. [2022-07-14 05:51:06,283 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 488 transitions. Word has length 33 [2022-07-14 05:51:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:06,284 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 488 transitions. [2022-07-14 05:51:06,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 488 transitions. [2022-07-14 05:51:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 05:51:06,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:06,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:06,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:06,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:06,499 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:06,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:06,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1920035533, now seen corresponding path program 1 times [2022-07-14 05:51:06,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:06,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081273599] [2022-07-14 05:51:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:06,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:06,509 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:06,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 05:51:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:06,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-14 05:51:06,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:06,793 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:06,793 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 12 treesize of output 12 [2022-07-14 05:51:06,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:06,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:06,850 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 7 treesize of output 3 [2022-07-14 05:51:06,856 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 7 treesize of output 3 [2022-07-14 05:51:07,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:07,447 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2022-07-14 05:51:07,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:07,465 INFO L356 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2022-07-14 05:51:07,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-07-14 05:51:07,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:07,474 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 25 treesize of output 27 [2022-07-14 05:51:07,477 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 21 treesize of output 13 [2022-07-14 05:51:07,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:51:07,556 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:07,556 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 05:51:07,799 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 24 treesize of output 12 [2022-07-14 05:51:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:07,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:07,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:07,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081273599] [2022-07-14 05:51:07,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081273599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:07,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:07,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-14 05:51:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682874714] [2022-07-14 05:51:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:07,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 05:51:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 05:51:07,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=255, Unknown=15, NotChecked=0, Total=306 [2022-07-14 05:51:07,892 INFO L87 Difference]: Start difference. First operand 379 states and 488 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:11,491 INFO L93 Difference]: Finished difference Result 451 states and 532 transitions. [2022-07-14 05:51:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 05:51:11,492 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-07-14 05:51:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:11,494 INFO L225 Difference]: With dead ends: 451 [2022-07-14 05:51:11,494 INFO L226 Difference]: Without dead ends: 451 [2022-07-14 05:51:11,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=104, Invalid=625, Unknown=27, NotChecked=0, Total=756 [2022-07-14 05:51:11,495 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 462 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 601 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:11,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1403 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1725 Invalid, 0 Unknown, 601 Unchecked, 2.9s Time] [2022-07-14 05:51:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-14 05:51:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 379. [2022-07-14 05:51:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.523972602739726) internal successors, (445), 356 states have internal predecessors, (445), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:51:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 487 transitions. [2022-07-14 05:51:11,507 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 487 transitions. Word has length 37 [2022-07-14 05:51:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:11,507 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 487 transitions. [2022-07-14 05:51:11,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 487 transitions. [2022-07-14 05:51:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 05:51:11,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:11,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:11,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-14 05:51:11,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:11,713 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting inspectErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1920024890, now seen corresponding path program 1 times [2022-07-14 05:51:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:11,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198889060] [2022-07-14 05:51:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:11,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:11,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:11,719 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:11,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 05:51:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:11,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 05:51:11,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:11,988 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:51:11,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 18 treesize of output 25 [2022-07-14 05:51:12,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:12,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:12,064 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 7 treesize of output 3 [2022-07-14 05:51:12,070 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 7 treesize of output 3 [2022-07-14 05:51:12,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:12,801 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2022-07-14 05:51:12,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:12,807 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 35 treesize of output 30 [2022-07-14 05:51:12,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:12,814 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 25 treesize of output 27 [2022-07-14 05:51:12,819 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 21 treesize of output 13 [2022-07-14 05:51:12,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:51:12,947 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:12,948 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 36 treesize of output 37 [2022-07-14 05:51:13,267 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 15 [2022-07-14 05:51:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:13,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:13,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:13,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198889060] [2022-07-14 05:51:13,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198889060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:13,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:13,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-14 05:51:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568785685] [2022-07-14 05:51:13,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:13,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 05:51:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:13,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 05:51:13,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=254, Unknown=15, NotChecked=0, Total=306 [2022-07-14 05:51:13,364 INFO L87 Difference]: Start difference. First operand 379 states and 487 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:14,845 INFO L93 Difference]: Finished difference Result 448 states and 529 transitions. [2022-07-14 05:51:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 05:51:14,845 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-07-14 05:51:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:14,849 INFO L225 Difference]: With dead ends: 448 [2022-07-14 05:51:14,849 INFO L226 Difference]: Without dead ends: 448 [2022-07-14 05:51:14,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=460, Unknown=21, NotChecked=0, Total=552 [2022-07-14 05:51:14,850 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 303 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1167 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:14,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1443 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 892 Invalid, 0 Unknown, 1167 Unchecked, 1.0s Time] [2022-07-14 05:51:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-07-14 05:51:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 379. [2022-07-14 05:51:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.5205479452054795) internal successors, (444), 356 states have internal predecessors, (444), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:51:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 486 transitions. [2022-07-14 05:51:14,862 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 486 transitions. Word has length 37 [2022-07-14 05:51:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:14,862 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 486 transitions. [2022-07-14 05:51:14,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 486 transitions. [2022-07-14 05:51:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 05:51:14,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:14,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:14,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:15,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:15,077 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting inspectErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1920024891, now seen corresponding path program 1 times [2022-07-14 05:51:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:15,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382647106] [2022-07-14 05:51:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:15,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:15,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:15,079 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:15,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 05:51:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:15,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 05:51:15,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:15,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:15,428 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:15,429 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 12 treesize of output 12 [2022-07-14 05:51:15,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:15,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:15,516 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 7 treesize of output 3 [2022-07-14 05:51:15,526 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 7 treesize of output 3 [2022-07-14 05:51:16,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:16,975 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 89 [2022-07-14 05:51:16,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:17,006 INFO L356 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2022-07-14 05:51:17,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 91 [2022-07-14 05:51:17,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:17,013 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 78 treesize of output 72 [2022-07-14 05:51:17,032 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 05:51:17,032 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 49 [2022-07-14 05:51:17,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:17,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2022-07-14 05:51:17,055 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 05:51:17,056 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 05:51:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:51:17,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 16 treesize of output 18 [2022-07-14 05:51:17,202 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:17,202 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 05:51:17,206 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 05:51:17,543 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 05:51:17,546 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 05:51:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:17,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:17,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:17,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382647106] [2022-07-14 05:51:17,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382647106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:17,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:17,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-14 05:51:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692105142] [2022-07-14 05:51:17,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:17,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 05:51:17,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:17,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 05:51:17,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=252, Unknown=15, NotChecked=0, Total=306 [2022-07-14 05:51:17,698 INFO L87 Difference]: Start difference. First operand 379 states and 486 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:19,378 INFO L93 Difference]: Finished difference Result 447 states and 528 transitions. [2022-07-14 05:51:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 05:51:19,379 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-07-14 05:51:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:19,381 INFO L225 Difference]: With dead ends: 447 [2022-07-14 05:51:19,381 INFO L226 Difference]: Without dead ends: 447 [2022-07-14 05:51:19,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=77, Invalid=501, Unknown=22, NotChecked=0, Total=600 [2022-07-14 05:51:19,382 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 296 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1471 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:19,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1488 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 878 Invalid, 0 Unknown, 1471 Unchecked, 1.2s Time] [2022-07-14 05:51:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-07-14 05:51:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 379. [2022-07-14 05:51:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.5102739726027397) internal successors, (441), 356 states have internal predecessors, (441), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:51:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 483 transitions. [2022-07-14 05:51:19,392 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 483 transitions. Word has length 37 [2022-07-14 05:51:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:19,393 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 483 transitions. [2022-07-14 05:51:19,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 483 transitions. [2022-07-14 05:51:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 05:51:19,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:19,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:19,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:19,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:19,606 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:19,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:19,606 INFO L85 PathProgramCache]: Analyzing trace with hash -912874368, now seen corresponding path program 1 times [2022-07-14 05:51:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:19,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800507676] [2022-07-14 05:51:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:19,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:19,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:19,609 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:19,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-14 05:51:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:19,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-14 05:51:19,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:19,906 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:19,907 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 12 treesize of output 12 [2022-07-14 05:51:19,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:19,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:19,963 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 7 treesize of output 3 [2022-07-14 05:51:19,974 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 7 treesize of output 3 [2022-07-14 05:51:27,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,729 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 157 [2022-07-14 05:51:27,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,799 INFO L356 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2022-07-14 05:51:27,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 184 treesize of output 167 [2022-07-14 05:51:27,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,808 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 154 treesize of output 140 [2022-07-14 05:51:27,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:27,832 INFO L356 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2022-07-14 05:51:27,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 52 [2022-07-14 05:51:28,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:28,030 INFO L356 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2022-07-14 05:51:28,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 48 [2022-07-14 05:51:28,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:28,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 16 treesize of output 18 [2022-07-14 05:51:28,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:28,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, 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 22 [2022-07-14 05:51:28,208 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-14 05:51:28,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 42 [2022-07-14 05:51:28,693 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 11 [2022-07-14 05:51:28,954 INFO L356 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-07-14 05:51:28,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 20 [2022-07-14 05:51:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:29,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:29,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:29,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800507676] [2022-07-14 05:51:29,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800507676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:29,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:29,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-14 05:51:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401818930] [2022-07-14 05:51:29,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:29,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 05:51:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:29,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 05:51:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=288, Unknown=14, NotChecked=0, Total=342 [2022-07-14 05:51:29,088 INFO L87 Difference]: Start difference. First operand 379 states and 483 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:34,903 INFO L93 Difference]: Finished difference Result 446 states and 526 transitions. [2022-07-14 05:51:34,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 05:51:34,904 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-07-14 05:51:34,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:34,905 INFO L225 Difference]: With dead ends: 446 [2022-07-14 05:51:34,905 INFO L226 Difference]: Without dead ends: 446 [2022-07-14 05:51:34,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=118, Invalid=726, Unknown=26, NotChecked=0, Total=870 [2022-07-14 05:51:34,906 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 388 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 573 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:34,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1540 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1721 Invalid, 0 Unknown, 573 Unchecked, 4.1s Time] [2022-07-14 05:51:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-07-14 05:51:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 379. [2022-07-14 05:51:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 356 states have internal predecessors, (440), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:51:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 482 transitions. [2022-07-14 05:51:34,924 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 482 transitions. Word has length 40 [2022-07-14 05:51:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:34,924 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 482 transitions. [2022-07-14 05:51:34,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 482 transitions. [2022-07-14 05:51:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 05:51:34,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:34,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:34,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:35,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:35,137 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash -8084452, now seen corresponding path program 1 times [2022-07-14 05:51:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:35,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512821909] [2022-07-14 05:51:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:35,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:35,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:35,139 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:35,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 05:51:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:35,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-14 05:51:35,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:35,490 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:35,491 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 12 treesize of output 12 [2022-07-14 05:51:35,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:35,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:35,589 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 7 treesize of output 3 [2022-07-14 05:51:35,601 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 7 treesize of output 3 [2022-07-14 05:51:39,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:39,883 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-14 05:51:39,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, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 94 [2022-07-14 05:51:39,903 INFO L356 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-07-14 05:51:39,904 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 51 [2022-07-14 05:51:39,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,911 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 28 [2022-07-14 05:51:39,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,918 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 23 treesize of output 25 [2022-07-14 05:51:40,144 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 05:51:40,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:40,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:40,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:40,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-07-14 05:51:40,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:40,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:40,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:40,188 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:51:40,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 50 [2022-07-14 05:51:40,196 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 05:51:40,826 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 05:51:41,133 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-14 05:51:41,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 23 [2022-07-14 05:51:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:41,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:41,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:41,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512821909] [2022-07-14 05:51:41,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512821909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:41,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:41,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-14 05:51:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912282635] [2022-07-14 05:51:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:41,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 05:51:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:41,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 05:51:41,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=292, Unknown=10, NotChecked=0, Total=342 [2022-07-14 05:51:41,274 INFO L87 Difference]: Start difference. First operand 379 states and 482 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:47,463 INFO L93 Difference]: Finished difference Result 445 states and 524 transitions. [2022-07-14 05:51:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 05:51:47,464 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-07-14 05:51:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:47,465 INFO L225 Difference]: With dead ends: 445 [2022-07-14 05:51:47,465 INFO L226 Difference]: Without dead ends: 445 [2022-07-14 05:51:47,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=118, Invalid=731, Unknown=21, NotChecked=0, Total=870 [2022-07-14 05:51:47,466 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 427 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:47,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1479 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1679 Invalid, 0 Unknown, 566 Unchecked, 4.4s Time] [2022-07-14 05:51:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-07-14 05:51:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 379. [2022-07-14 05:51:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.5034246575342465) internal successors, (439), 356 states have internal predecessors, (439), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:51:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 481 transitions. [2022-07-14 05:51:47,475 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 481 transitions. Word has length 43 [2022-07-14 05:51:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:47,476 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 481 transitions. [2022-07-14 05:51:47,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 481 transitions. [2022-07-14 05:51:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 05:51:47,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:47,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:47,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:47,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:47,689 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash -610222928, now seen corresponding path program 1 times [2022-07-14 05:51:47,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:47,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447533820] [2022-07-14 05:51:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:47,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:47,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:47,692 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:47,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-14 05:51:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:47,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 05:51:47,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:47,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 05:51:48,039 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:48,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 05:51:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:48,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:48,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:48,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447533820] [2022-07-14 05:51:48,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447533820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:48,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:48,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:51:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241384483] [2022-07-14 05:51:48,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:48,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:51:48,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:51:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:51:48,058 INFO L87 Difference]: Start difference. First operand 379 states and 481 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:48,583 INFO L93 Difference]: Finished difference Result 378 states and 477 transitions. [2022-07-14 05:51:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:51:48,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-07-14 05:51:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:48,585 INFO L225 Difference]: With dead ends: 378 [2022-07-14 05:51:48,586 INFO L226 Difference]: Without dead ends: 378 [2022-07-14 05:51:48,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 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 05:51:48,586 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 288 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:48,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 288 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 05:51:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-07-14 05:51:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-07-14 05:51:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 292 states have (on average 1.4931506849315068) internal successors, (436), 355 states have internal predecessors, (436), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:51:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 477 transitions. [2022-07-14 05:51:48,601 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 477 transitions. Word has length 46 [2022-07-14 05:51:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:48,601 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 477 transitions. [2022-07-14 05:51:48,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 477 transitions. [2022-07-14 05:51:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 05:51:48,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:48,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:48,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:48,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:48,815 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting inspectErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash -610231965, now seen corresponding path program 1 times [2022-07-14 05:51:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:48,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243366627] [2022-07-14 05:51:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:48,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:48,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:48,818 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:48,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-14 05:51:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:49,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 05:51:49,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:49,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:49,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:49,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243366627] [2022-07-14 05:51:49,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243366627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:49,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:49,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:51:49,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714374276] [2022-07-14 05:51:49,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:49,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:51:49,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:51:49,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:51:49,054 INFO L87 Difference]: Start difference. First operand 378 states and 477 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:49,543 INFO L93 Difference]: Finished difference Result 372 states and 459 transitions. [2022-07-14 05:51:49,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:51:49,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-07-14 05:51:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:49,546 INFO L225 Difference]: With dead ends: 372 [2022-07-14 05:51:49,546 INFO L226 Difference]: Without dead ends: 372 [2022-07-14 05:51:49,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:51:49,547 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 121 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 295 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.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:49,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 295 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 05:51:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-14 05:51:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2022-07-14 05:51:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 292 states have (on average 1.4315068493150684) internal successors, (418), 349 states have internal predecessors, (418), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:51:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 459 transitions. [2022-07-14 05:51:49,575 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 459 transitions. Word has length 46 [2022-07-14 05:51:49,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:49,576 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 459 transitions. [2022-07-14 05:51:49,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 459 transitions. [2022-07-14 05:51:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 05:51:49,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:49,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:49,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:49,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:49,787 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting inspectErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash -610231964, now seen corresponding path program 1 times [2022-07-14 05:51:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:49,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828455322] [2022-07-14 05:51:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:49,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:49,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:49,790 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:49,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-14 05:51:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:50,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-14 05:51:50,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:50,115 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:50,115 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 12 treesize of output 12 [2022-07-14 05:51:50,126 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 05:51:50,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 05:51:50,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:50,225 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 7 treesize of output 3 [2022-07-14 05:51:50,232 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 7 treesize of output 3 [2022-07-14 05:51:51,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:51,566 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 89 [2022-07-14 05:51:51,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:51,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-07-14 05:51:51,602 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 05:51:51,602 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 47 [2022-07-14 05:51:51,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:51,610 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 31 treesize of output 26 [2022-07-14 05:51:51,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:51,630 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 21 treesize of output 23 [2022-07-14 05:51:51,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:51,639 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 21 treesize of output 23 [2022-07-14 05:51:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:51:51,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:51:51,840 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:51,841 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 05:51:51,848 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 05:51:52,301 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 05:51:52,305 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 05:51:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:52,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:52,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:52,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828455322] [2022-07-14 05:51:52,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828455322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:52,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:52,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-14 05:51:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864468489] [2022-07-14 05:51:52,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:52,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 05:51:52,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:52,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 05:51:52,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=286, Unknown=15, NotChecked=0, Total=342 [2022-07-14 05:51:52,624 INFO L87 Difference]: Start difference. First operand 372 states and 459 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:55,622 INFO L93 Difference]: Finished difference Result 424 states and 493 transitions. [2022-07-14 05:51:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 05:51:55,623 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-07-14 05:51:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:55,624 INFO L225 Difference]: With dead ends: 424 [2022-07-14 05:51:55,624 INFO L226 Difference]: Without dead ends: 424 [2022-07-14 05:51:55,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=94, Invalid=638, Unknown=24, NotChecked=0, Total=756 [2022-07-14 05:51:55,625 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 294 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1084 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:55,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1389 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1005 Invalid, 0 Unknown, 1084 Unchecked, 2.0s Time] [2022-07-14 05:51:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-07-14 05:51:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 372. [2022-07-14 05:51:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 292 states have (on average 1.4075342465753424) internal successors, (411), 349 states have internal predecessors, (411), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:51:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 452 transitions. [2022-07-14 05:51:55,632 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 452 transitions. Word has length 46 [2022-07-14 05:51:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:55,633 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 452 transitions. [2022-07-14 05:51:55,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:51:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 452 transitions. [2022-07-14 05:51:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 05:51:55,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:55,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:55,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:55,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:55,846 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:51:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:55,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1176224425, now seen corresponding path program 1 times [2022-07-14 05:51:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:55,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425911247] [2022-07-14 05:51:55,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:55,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:55,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:55,848 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:55,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-14 05:51:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:56,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-14 05:51:56,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:56,152 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:56,152 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 12 treesize of output 12 [2022-07-14 05:51:56,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:51:56,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 05:51:56,235 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 7 treesize of output 3 [2022-07-14 05:51:56,244 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 7 treesize of output 3 [2022-07-14 05:51:57,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:57,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 93 [2022-07-14 05:51:57,494 INFO L356 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-07-14 05:51:57,495 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 51 [2022-07-14 05:51:57,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:57,504 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 28 [2022-07-14 05:51:57,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:57,512 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 31 treesize of output 26 [2022-07-14 05:51:57,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:57,525 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 23 treesize of output 25 [2022-07-14 05:51:57,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:57,531 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 21 treesize of output 23 [2022-07-14 05:51:57,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:51:57,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 05:51:57,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:57,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 35 [2022-07-14 05:51:57,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 26 [2022-07-14 05:51:58,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:58,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:58,833 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:51:58,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 27 [2022-07-14 05:51:58,846 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-07-14 05:51:58,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 18 [2022-07-14 05:51:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:58,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:58,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:58,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425911247] [2022-07-14 05:51:58,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425911247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:58,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:58,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-14 05:51:58,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631935904] [2022-07-14 05:51:58,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:58,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 05:51:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:58,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 05:51:58,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=323, Unknown=15, NotChecked=0, Total=380 [2022-07-14 05:51:58,950 INFO L87 Difference]: Start difference. First operand 372 states and 452 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:05,251 INFO L93 Difference]: Finished difference Result 422 states and 489 transitions. [2022-07-14 05:52:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 05:52:05,252 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-07-14 05:52:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:05,253 INFO L225 Difference]: With dead ends: 422 [2022-07-14 05:52:05,253 INFO L226 Difference]: Without dead ends: 422 [2022-07-14 05:52:05,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=146, Invalid=945, Unknown=31, NotChecked=0, Total=1122 [2022-07-14 05:52:05,254 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 409 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:05,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1744 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1798 Invalid, 0 Unknown, 531 Unchecked, 4.4s Time] [2022-07-14 05:52:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-14 05:52:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 372. [2022-07-14 05:52:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 292 states have (on average 1.4006849315068493) internal successors, (409), 349 states have internal predecessors, (409), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:52:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 450 transitions. [2022-07-14 05:52:05,260 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 450 transitions. Word has length 49 [2022-07-14 05:52:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:05,261 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 450 transitions. [2022-07-14 05:52:05,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 450 transitions. [2022-07-14 05:52:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 05:52:05,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:05,262 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:05,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-14 05:52:05,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:52:05,473 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2022-07-14 05:52:05,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:05,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1567315803, now seen corresponding path program 1 times [2022-07-14 05:52:05,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:52:05,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550154440] [2022-07-14 05:52:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:05,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:52:05,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:52:05,475 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:52:05,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-14 05:52:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:05,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-14 05:52:05,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:52:05,939 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:52:05,939 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 12 treesize of output 12 [2022-07-14 05:52:05,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:52:06,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:52:06,014 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 7 treesize of output 3 [2022-07-14 05:52:06,018 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 7 treesize of output 3 [2022-07-14 05:52:06,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:06,680 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2022-07-14 05:52:06,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:06,708 INFO L356 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2022-07-14 05:52:06,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-07-14 05:52:06,715 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 11 [2022-07-14 05:52:06,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:06,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-07-14 05:52:06,813 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 23 [2022-07-14 05:52:06,854 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:52:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2022-07-14 05:52:06,988 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:52:06,989 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 12 treesize of output 12 [2022-07-14 05:52:07,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 28 treesize of output 26 [2022-07-14 05:52:07,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:07,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2022-07-14 05:52:07,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:08,017 INFO L356 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2022-07-14 05:52:08,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:52:08,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550154440] [2022-07-14 05:52:08,019 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 05:52:08,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-14 05:52:08,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:52:08,221 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_26| input size 56 context size 56 output size 56 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 05:52:08,226 INFO L158 Benchmark]: Toolchain (without parser) took 111006.96ms. Allocated memory was 50.3MB in the beginning and 96.5MB in the end (delta: 46.1MB). Free memory was 25.4MB in the beginning and 23.1MB in the end (delta: 2.3MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2022-07-14 05:52:08,226 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 50.3MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:52:08,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.31ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 25.2MB in the beginning and 42.9MB in the end (delta: -17.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-07-14 05:52:08,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.19ms. Allocated memory is still 65.0MB. Free memory was 42.9MB in the beginning and 40.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:52:08,239 INFO L158 Benchmark]: Boogie Preprocessor took 58.34ms. Allocated memory is still 65.0MB. Free memory was 40.1MB in the beginning and 37.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 05:52:08,239 INFO L158 Benchmark]: RCFGBuilder took 1071.95ms. Allocated memory is still 65.0MB. Free memory was 37.3MB in the beginning and 41.8MB in the end (delta: -4.5MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2022-07-14 05:52:08,239 INFO L158 Benchmark]: TraceAbstraction took 109067.67ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 41.1MB in the beginning and 23.1MB in the end (delta: 17.9MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2022-07-14 05:52:08,240 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 50.3MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 720.31ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 25.2MB in the beginning and 42.9MB in the end (delta: -17.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.19ms. Allocated memory is still 65.0MB. Free memory was 42.9MB in the beginning and 40.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.34ms. Allocated memory is still 65.0MB. Free memory was 40.1MB in the beginning and 37.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1071.95ms. Allocated memory is still 65.0MB. Free memory was 37.3MB in the beginning and 41.8MB in the end (delta: -4.5MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 109067.67ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 41.1MB in the beginning and 23.1MB in the end (delta: 17.9MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_26| input size 56 context size 56 output size 56 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_26| input size 56 context size 56 output size 56: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 05:52:08,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_26| input size 56 context size 56 output size 56