./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:02:58,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:02:58,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:02:58,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:02:58,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:02:58,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:02:58,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:02:58,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:02:58,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:02:58,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:02:58,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:02:58,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:02:58,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:02:58,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:02:58,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:02:58,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:02:58,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:02:58,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:02:58,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:02:58,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:02:58,069 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:02:58,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:02:58,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:02:58,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:02:58,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:02:58,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:02:58,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:02:58,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:02:58,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:02:58,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:02:58,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:02:58,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:02:58,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:02:58,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:02:58,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:02:58,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:02:58,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:02:58,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:02:58,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:02:58,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:02:58,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:02:58,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:02:58,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:02:58,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:02:58,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:02:58,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:02:58,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:02:58,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:02:58,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:02:58,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:02:58,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:02:58,137 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:02:58,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:02:58,138 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:02:58,138 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:02:58,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:02:58,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:02:58,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:02:58,139 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:02:58,139 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:02:58,140 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:02:58,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:02:58,140 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:02:58,140 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:02:58,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:02:58,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:02:58,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:02:58,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:02:58,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:02:58,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:02:58,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:02:58,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:02:58,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:02:58,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2022-07-20 06:02:58,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:02:58,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:02:58,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:02:58,436 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:02:58,437 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:02:58,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-07-20 06:02:58,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78965bda6/fa4a603a0ce0446fbe41ee0870e71590/FLAGd2563888c [2022-07-20 06:02:59,040 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:02:59,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-07-20 06:02:59,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78965bda6/fa4a603a0ce0446fbe41ee0870e71590/FLAGd2563888c [2022-07-20 06:02:59,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78965bda6/fa4a603a0ce0446fbe41ee0870e71590 [2022-07-20 06:02:59,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:02:59,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:02:59,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:02:59,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:02:59,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:02:59,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4728cf12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59, skipping insertion in model container [2022-07-20 06:02:59,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:02:59,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:02:59,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2022-07-20 06:02:59,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2022-07-20 06:02:59,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2022-07-20 06:02:59,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2022-07-20 06:02:59,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2022-07-20 06:02:59,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2022-07-20 06:02:59,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2022-07-20 06:02:59,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:02:59,706 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:02:59,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2022-07-20 06:02:59,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2022-07-20 06:02:59,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2022-07-20 06:02:59,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2022-07-20 06:02:59,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2022-07-20 06:02:59,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2022-07-20 06:02:59,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2022-07-20 06:02:59,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:02:59,788 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:02:59,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59 WrapperNode [2022-07-20 06:02:59,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:02:59,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:02:59,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:02:59,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:02:59,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,834 INFO L137 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 159 [2022-07-20 06:02:59,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:02:59,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:02:59,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:02:59,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:02:59,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:02:59,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:02:59,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:02:59,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:02:59,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (1/1) ... [2022-07-20 06:02:59,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:02:59,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:02:59,914 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-20 06:02:59,949 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-20 06:02:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:02:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:02:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:02:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:02:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:02:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:02:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:02:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:02:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:02:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:03:00,062 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:03:00,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:03:00,566 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:03:00,575 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:03:00,577 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-07-20 06:03:00,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:03:00 BoogieIcfgContainer [2022-07-20 06:03:00,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:03:00,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:03:00,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:03:00,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:03:00,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:02:59" (1/3) ... [2022-07-20 06:03:00,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3094039a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:03:00, skipping insertion in model container [2022-07-20 06:03:00,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:59" (2/3) ... [2022-07-20 06:03:00,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3094039a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:03:00, skipping insertion in model container [2022-07-20 06:03:00,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:03:00" (3/3) ... [2022-07-20 06:03:00,591 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2022-07-20 06:03:00,605 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:03:00,605 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2022-07-20 06:03:00,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:03:00,677 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@e1cc774, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c9188d8 [2022-07-20 06:03:00,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2022-07-20 06:03:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 84 states have (on average 2.2023809523809526) internal successors, (185), 155 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:03:00,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:00,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:03:00,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:00,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:03:00,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:00,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332793980] [2022-07-20 06:03:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:00,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:00,894 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-20 06:03:00,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:00,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332793980] [2022-07-20 06:03:00,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332793980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:00,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:00,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:03:00,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615092412] [2022-07-20 06:03:00,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:00,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:03:00,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:00,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:03:00,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:00,939 INFO L87 Difference]: Start difference. First operand has 156 states, 84 states have (on average 2.2023809523809526) internal successors, (185), 155 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:01,108 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2022-07-20 06:03:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:03:01,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 06:03:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:01,131 INFO L225 Difference]: With dead ends: 157 [2022-07-20 06:03:01,131 INFO L226 Difference]: Without dead ends: 153 [2022-07-20 06:03:01,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:01,136 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:01,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 95 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-20 06:03:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2022-07-20 06:03:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 85 states have (on average 1.8352941176470587) internal successors, (156), 148 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2022-07-20 06:03:01,173 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2022-07-20 06:03:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:01,173 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2022-07-20 06:03:01,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2022-07-20 06:03:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:03:01,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:01,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:03:01,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:03:01,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:01,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:03:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:01,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056170590] [2022-07-20 06:03:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:01,215 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-20 06:03:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:01,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056170590] [2022-07-20 06:03:01,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056170590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:01,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:01,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:03:01,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129191142] [2022-07-20 06:03:01,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:01,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:03:01,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:01,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:03:01,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:01,219 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:01,322 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2022-07-20 06:03:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:03:01,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 06:03:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:01,324 INFO L225 Difference]: With dead ends: 166 [2022-07-20 06:03:01,324 INFO L226 Difference]: Without dead ends: 166 [2022-07-20 06:03:01,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:01,325 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 131 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:01,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 100 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-20 06:03:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2022-07-20 06:03:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 152 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2022-07-20 06:03:01,335 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 3 [2022-07-20 06:03:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:01,336 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2022-07-20 06:03:01,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2022-07-20 06:03:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:03:01,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:01,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:01,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:03:01,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-07-20 06:03:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:01,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150469346] [2022-07-20 06:03:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:01,415 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-20 06:03:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:01,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150469346] [2022-07-20 06:03:01,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150469346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:01,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:01,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:03:01,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395311646] [2022-07-20 06:03:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:01,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:01,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:01,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:01,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:01,420 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:01,575 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2022-07-20 06:03:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:03:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-20 06:03:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:01,577 INFO L225 Difference]: With dead ends: 154 [2022-07-20 06:03:01,577 INFO L226 Difference]: Without dead ends: 154 [2022-07-20 06:03:01,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:01,579 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 214 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:01,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 77 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-20 06:03:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2022-07-20 06:03:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 139 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2022-07-20 06:03:01,587 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 9 [2022-07-20 06:03:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:01,588 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2022-07-20 06:03:01,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2022-07-20 06:03:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:03:01,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:01,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:01,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:03:01,589 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:01,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-07-20 06:03:01,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:01,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172922883] [2022-07-20 06:03:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:01,736 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-20 06:03:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:01,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172922883] [2022-07-20 06:03:01,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172922883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:01,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:01,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:03:01,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208077059] [2022-07-20 06:03:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:01,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:03:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:03:01,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:03:01,746 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:02,036 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2022-07-20 06:03:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:03:02,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-20 06:03:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:02,037 INFO L225 Difference]: With dead ends: 179 [2022-07-20 06:03:02,037 INFO L226 Difference]: Without dead ends: 179 [2022-07-20 06:03:02,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:02,038 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 321 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:02,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 140 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:03:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-20 06:03:02,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2022-07-20 06:03:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.542857142857143) internal successors, (162), 149 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2022-07-20 06:03:02,050 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 9 [2022-07-20 06:03:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:02,051 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2022-07-20 06:03:02,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2022-07-20 06:03:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:03:02,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:02,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:02,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:03:02,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:02,052 INFO L85 PathProgramCache]: Analyzing trace with hash 233166301, now seen corresponding path program 1 times [2022-07-20 06:03:02,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:02,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183889407] [2022-07-20 06:03:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:02,099 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-20 06:03:02,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:02,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183889407] [2022-07-20 06:03:02,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183889407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:02,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:02,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350326418] [2022-07-20 06:03:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:02,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:02,102 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:02,224 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2022-07-20 06:03:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:03:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-20 06:03:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:02,228 INFO L225 Difference]: With dead ends: 164 [2022-07-20 06:03:02,228 INFO L226 Difference]: Without dead ends: 164 [2022-07-20 06:03:02,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:02,231 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 149 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:02,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 175 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-20 06:03:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2022-07-20 06:03:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 104 states have (on average 1.5192307692307692) internal successors, (158), 147 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-07-20 06:03:02,241 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 11 [2022-07-20 06:03:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:02,241 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-07-20 06:03:02,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-07-20 06:03:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:03:02,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:02,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:02,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:03:02,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:02,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:02,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-07-20 06:03:02,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:02,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438816083] [2022-07-20 06:03:02,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:02,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:02,352 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-20 06:03:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:02,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438816083] [2022-07-20 06:03:02,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438816083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:02,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:02,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:02,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716474593] [2022-07-20 06:03:02,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:02,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:02,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:02,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:02,354 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:02,497 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-07-20 06:03:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:02,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-20 06:03:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:02,499 INFO L225 Difference]: With dead ends: 147 [2022-07-20 06:03:02,499 INFO L226 Difference]: Without dead ends: 147 [2022-07-20 06:03:02,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:02,500 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:02,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 323 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-20 06:03:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-07-20 06:03:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 104 states have (on average 1.5) internal successors, (156), 146 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2022-07-20 06:03:02,505 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 12 [2022-07-20 06:03:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:02,506 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2022-07-20 06:03:02,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2022-07-20 06:03:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:03:02,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:02,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:02,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:03:02,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-07-20 06:03:02,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:02,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016222087] [2022-07-20 06:03:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:02,563 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-20 06:03:02,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:02,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016222087] [2022-07-20 06:03:02,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016222087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:02,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:02,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164850120] [2022-07-20 06:03:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:02,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:02,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:02,566 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:02,715 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-07-20 06:03:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:03:02,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-20 06:03:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:02,717 INFO L225 Difference]: With dead ends: 146 [2022-07-20 06:03:02,717 INFO L226 Difference]: Without dead ends: 146 [2022-07-20 06:03:02,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:02,718 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 7 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:02,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 338 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-20 06:03:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-07-20 06:03:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 145 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2022-07-20 06:03:02,722 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 12 [2022-07-20 06:03:02,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:02,722 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2022-07-20 06:03:02,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2022-07-20 06:03:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:03:02,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:02,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:02,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:03:02,724 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1299214142, now seen corresponding path program 1 times [2022-07-20 06:03:02,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:02,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038838742] [2022-07-20 06:03:02,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:02,776 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-20 06:03:02,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:02,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038838742] [2022-07-20 06:03:02,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038838742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:02,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:02,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:03:02,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227061376] [2022-07-20 06:03:02,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:02,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:03:02,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:02,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:03:02,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:03:02,778 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:02,961 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2022-07-20 06:03:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:02,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-20 06:03:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:02,963 INFO L225 Difference]: With dead ends: 200 [2022-07-20 06:03:02,963 INFO L226 Difference]: Without dead ends: 200 [2022-07-20 06:03:02,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:03:02,964 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:02,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 314 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-20 06:03:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 151. [2022-07-20 06:03:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 150 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2022-07-20 06:03:02,973 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 14 [2022-07-20 06:03:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:02,973 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2022-07-20 06:03:02,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2022-07-20 06:03:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:03:02,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:02,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:02,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:03:02,976 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-07-20 06:03:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:02,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675711013] [2022-07-20 06:03:02,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:03,071 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-20 06:03:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:03,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675711013] [2022-07-20 06:03:03,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675711013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:03,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:03,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:03:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625987650] [2022-07-20 06:03:03,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:03,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:03:03,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:03,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:03:03,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:03:03,074 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:03,345 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-07-20 06:03:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:03:03,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:03:03,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:03,347 INFO L225 Difference]: With dead ends: 150 [2022-07-20 06:03:03,347 INFO L226 Difference]: Without dead ends: 150 [2022-07-20 06:03:03,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:03:03,348 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 187 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:03,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 221 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-20 06:03:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-20 06:03:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 149 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2022-07-20 06:03:03,351 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 16 [2022-07-20 06:03:03,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:03,351 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2022-07-20 06:03:03,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,351 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-07-20 06:03:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:03:03,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:03,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:03,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 06:03:03,352 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:03,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:03,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-07-20 06:03:03,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:03,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141870814] [2022-07-20 06:03:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:03,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:03,510 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-20 06:03:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:03,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141870814] [2022-07-20 06:03:03,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141870814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:03,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:03,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:03:03,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73943025] [2022-07-20 06:03:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:03,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:03:03,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:03,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:03:03,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:03:03,513 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:04,042 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2022-07-20 06:03:04,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:03:04,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:03:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:04,043 INFO L225 Difference]: With dead ends: 168 [2022-07-20 06:03:04,044 INFO L226 Difference]: Without dead ends: 168 [2022-07-20 06:03:04,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-20 06:03:04,045 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 233 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:04,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 355 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:03:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-20 06:03:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2022-07-20 06:03:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 153 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2022-07-20 06:03:04,048 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 16 [2022-07-20 06:03:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:04,048 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2022-07-20 06:03:04,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2022-07-20 06:03:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:03:04,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:04,049 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:04,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:03:04,050 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:04,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1997554901, now seen corresponding path program 1 times [2022-07-20 06:03:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:04,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350936089] [2022-07-20 06:03:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:04,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350936089] [2022-07-20 06:03:04,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350936089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:04,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381136322] [2022-07-20 06:03:04,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:04,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:04,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:04,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:04,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 06:03:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:04,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 06:03:04,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:04,292 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-20 06:03:04,298 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-20 06:03:04,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:04,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:04,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:04,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:04,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:04,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:04,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:04,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:04,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:04,513 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 15 treesize of output 7 [2022-07-20 06:03:04,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:04,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:04,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-07-20 06:03:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:04,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:10,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-20 06:03:10,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:10,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:10,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-20 06:03:10,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-20 06:03:10,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:10,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:10,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:10,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381136322] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:10,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:10,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 14 [2022-07-20 06:03:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313041118] [2022-07-20 06:03:10,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:10,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 06:03:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:10,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 06:03:10,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=142, Unknown=4, NotChecked=0, Total=182 [2022-07-20 06:03:10,086 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:10,419 INFO L93 Difference]: Finished difference Result 205 states and 221 transitions. [2022-07-20 06:03:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:03:10,420 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 06:03:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:10,421 INFO L225 Difference]: With dead ends: 205 [2022-07-20 06:03:10,421 INFO L226 Difference]: Without dead ends: 205 [2022-07-20 06:03:10,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=96, Invalid=280, Unknown=4, NotChecked=0, Total=380 [2022-07-20 06:03:10,422 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 343 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:10,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 579 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 331 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2022-07-20 06:03:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-20 06:03:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 161. [2022-07-20 06:03:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.380952380952381) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2022-07-20 06:03:10,426 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 21 [2022-07-20 06:03:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:10,426 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2022-07-20 06:03:10,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2022-07-20 06:03:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:03:10,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:10,427 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] [2022-07-20 06:03:10,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 06:03:10,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-20 06:03:10,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:10,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2039573154, now seen corresponding path program 1 times [2022-07-20 06:03:10,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:10,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222895429] [2022-07-20 06:03:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:10,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222895429] [2022-07-20 06:03:10,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222895429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:10,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:10,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:03:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562062239] [2022-07-20 06:03:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:10,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:10,699 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:10,834 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2022-07-20 06:03:10,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:03:10,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 06:03:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:10,835 INFO L225 Difference]: With dead ends: 165 [2022-07-20 06:03:10,835 INFO L226 Difference]: Without dead ends: 165 [2022-07-20 06:03:10,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:03:10,836 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 25 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:10,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 328 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-20 06:03:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2022-07-20 06:03:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 125 states have (on average 1.368) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2022-07-20 06:03:10,840 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 21 [2022-07-20 06:03:10,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:10,840 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2022-07-20 06:03:10,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2022-07-20 06:03:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:03:10,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:10,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:10,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 06:03:10,842 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:10,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:10,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1819127547, now seen corresponding path program 1 times [2022-07-20 06:03:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:10,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527122977] [2022-07-20 06:03:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:10,876 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-20 06:03:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:10,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527122977] [2022-07-20 06:03:10,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527122977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:10,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:10,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838684862] [2022-07-20 06:03:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:10,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:10,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:10,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:10,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:10,879 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:10,960 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2022-07-20 06:03:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:03:10,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 06:03:10,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:10,961 INFO L225 Difference]: With dead ends: 162 [2022-07-20 06:03:10,962 INFO L226 Difference]: Without dead ends: 162 [2022-07-20 06:03:10,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:10,962 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 20 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:10,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 279 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-20 06:03:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-07-20 06:03:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 157 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2022-07-20 06:03:10,966 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 22 [2022-07-20 06:03:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:10,967 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2022-07-20 06:03:10,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2022-07-20 06:03:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:03:10,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:10,968 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] [2022-07-20 06:03:10,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:03:10,968 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash 391604008, now seen corresponding path program 1 times [2022-07-20 06:03:10,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:10,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17332701] [2022-07-20 06:03:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:11,023 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-20 06:03:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:11,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17332701] [2022-07-20 06:03:11,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17332701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:11,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:11,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:11,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775308375] [2022-07-20 06:03:11,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:11,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:11,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:11,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:11,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:11,027 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:11,123 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2022-07-20 06:03:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:03:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 06:03:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:11,124 INFO L225 Difference]: With dead ends: 157 [2022-07-20 06:03:11,124 INFO L226 Difference]: Without dead ends: 157 [2022-07-20 06:03:11,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:11,125 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:11,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 313 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-20 06:03:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-07-20 06:03:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.346774193548387) internal successors, (167), 156 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2022-07-20 06:03:11,130 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 24 [2022-07-20 06:03:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:11,131 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2022-07-20 06:03:11,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2022-07-20 06:03:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:03:11,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:11,133 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] [2022-07-20 06:03:11,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:03:11,133 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:11,134 INFO L85 PathProgramCache]: Analyzing trace with hash 391604009, now seen corresponding path program 1 times [2022-07-20 06:03:11,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:11,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210668059] [2022-07-20 06:03:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:11,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:11,208 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-20 06:03:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:11,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210668059] [2022-07-20 06:03:11,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210668059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:11,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:11,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409830015] [2022-07-20 06:03:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:11,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:11,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:11,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:11,213 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:11,336 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-07-20 06:03:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:11,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 06:03:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:11,337 INFO L225 Difference]: With dead ends: 156 [2022-07-20 06:03:11,337 INFO L226 Difference]: Without dead ends: 156 [2022-07-20 06:03:11,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:11,340 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:11,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-20 06:03:11,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-07-20 06:03:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 155 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2022-07-20 06:03:11,344 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 24 [2022-07-20 06:03:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:11,344 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2022-07-20 06:03:11,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2022-07-20 06:03:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:03:11,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:11,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:11,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:03:11,348 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:11,349 INFO L85 PathProgramCache]: Analyzing trace with hash -264588155, now seen corresponding path program 1 times [2022-07-20 06:03:11,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:11,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563819359] [2022-07-20 06:03:11,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:11,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:11,429 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-20 06:03:11,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:11,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563819359] [2022-07-20 06:03:11,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563819359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:11,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:11,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360060256] [2022-07-20 06:03:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:11,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:11,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:11,432 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:11,525 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2022-07-20 06:03:11,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:03:11,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:03:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:11,526 INFO L225 Difference]: With dead ends: 155 [2022-07-20 06:03:11,527 INFO L226 Difference]: Without dead ends: 155 [2022-07-20 06:03:11,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-20 06:03:11,527 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 15 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:11,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 255 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-20 06:03:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-07-20 06:03:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 153 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2022-07-20 06:03:11,532 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 25 [2022-07-20 06:03:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:11,532 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2022-07-20 06:03:11,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2022-07-20 06:03:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:03:11,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:11,534 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-20 06:03:11,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:03:11,534 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:11,535 INFO L85 PathProgramCache]: Analyzing trace with hash 201988172, now seen corresponding path program 1 times [2022-07-20 06:03:11,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:11,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104594032] [2022-07-20 06:03:11,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:11,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:11,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:11,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104594032] [2022-07-20 06:03:11,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104594032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:11,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:11,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:03:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587572328] [2022-07-20 06:03:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:11,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:03:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:11,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:03:11,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:11,578 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:11,617 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2022-07-20 06:03:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:03:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:03:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:11,619 INFO L225 Difference]: With dead ends: 156 [2022-07-20 06:03:11,619 INFO L226 Difference]: Without dead ends: 156 [2022-07-20 06:03:11,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:11,620 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 72 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:11,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:03:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-20 06:03:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-07-20 06:03:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 125 states have (on average 1.32) internal successors, (165), 155 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2022-07-20 06:03:11,624 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 27 [2022-07-20 06:03:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:11,624 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2022-07-20 06:03:11,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2022-07-20 06:03:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:03:11,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:11,625 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-20 06:03:11,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 06:03:11,626 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:11,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash -866016759, now seen corresponding path program 1 times [2022-07-20 06:03:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:11,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135819152] [2022-07-20 06:03:11,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:11,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:11,701 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-20 06:03:11,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:11,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135819152] [2022-07-20 06:03:11,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135819152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:11,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:11,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:03:11,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753972607] [2022-07-20 06:03:11,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:11,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:03:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:11,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:03:11,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:03:11,704 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:11,834 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2022-07-20 06:03:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:03:11,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:03:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:11,836 INFO L225 Difference]: With dead ends: 169 [2022-07-20 06:03:11,836 INFO L226 Difference]: Without dead ends: 169 [2022-07-20 06:03:11,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:03:11,837 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 163 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:11,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 172 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-20 06:03:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2022-07-20 06:03:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 153 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2022-07-20 06:03:11,841 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 27 [2022-07-20 06:03:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:11,842 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2022-07-20 06:03:11,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2022-07-20 06:03:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:03:11,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:11,843 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] [2022-07-20 06:03:11,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 06:03:11,843 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1099927530, now seen corresponding path program 1 times [2022-07-20 06:03:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:11,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49010307] [2022-07-20 06:03:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:11,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:11,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49010307] [2022-07-20 06:03:11,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49010307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:11,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:11,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:03:11,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859991886] [2022-07-20 06:03:11,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:11,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:03:11,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:11,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:03:11,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:03:11,954 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:12,152 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2022-07-20 06:03:12,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:03:12,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-07-20 06:03:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:12,153 INFO L225 Difference]: With dead ends: 154 [2022-07-20 06:03:12,153 INFO L226 Difference]: Without dead ends: 154 [2022-07-20 06:03:12,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:03:12,154 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 59 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:12,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 260 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-20 06:03:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2022-07-20 06:03:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 152 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2022-07-20 06:03:12,157 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 28 [2022-07-20 06:03:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:12,158 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2022-07-20 06:03:12,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2022-07-20 06:03:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:03:12,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:12,158 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] [2022-07-20 06:03:12,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 06:03:12,159 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1099927531, now seen corresponding path program 1 times [2022-07-20 06:03:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:12,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928907399] [2022-07-20 06:03:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:12,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:12,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928907399] [2022-07-20 06:03:12,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928907399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:12,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:12,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:03:12,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400656435] [2022-07-20 06:03:12,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:12,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:03:12,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:12,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:03:12,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:03:12,278 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:12,572 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2022-07-20 06:03:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:03:12,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-07-20 06:03:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:12,574 INFO L225 Difference]: With dead ends: 149 [2022-07-20 06:03:12,574 INFO L226 Difference]: Without dead ends: 149 [2022-07-20 06:03:12,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:03:12,574 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 69 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:12,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 400 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-20 06:03:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2022-07-20 06:03:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 129 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2022-07-20 06:03:12,577 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 28 [2022-07-20 06:03:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:12,577 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2022-07-20 06:03:12,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-07-20 06:03:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:03:12,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:12,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:12,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 06:03:12,578 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2136034553, now seen corresponding path program 1 times [2022-07-20 06:03:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:12,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772533232] [2022-07-20 06:03:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:12,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:12,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:12,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772533232] [2022-07-20 06:03:12,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772533232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:12,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795941134] [2022-07-20 06:03:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:12,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:12,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:12,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:12,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 06:03:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:12,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:03:12,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:12,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:03:12,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 06:03:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:12,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:03:12,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795941134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:12,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:03:12,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-20 06:03:12,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588069941] [2022-07-20 06:03:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:12,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:03:12,814 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:12,878 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2022-07-20 06:03:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:03:12,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:03:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:12,879 INFO L225 Difference]: With dead ends: 139 [2022-07-20 06:03:12,879 INFO L226 Difference]: Without dead ends: 139 [2022-07-20 06:03:12,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:03:12,880 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 6 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:12,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 252 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-20 06:03:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2022-07-20 06:03:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 132 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2022-07-20 06:03:12,883 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 29 [2022-07-20 06:03:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:12,884 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2022-07-20 06:03:12,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2022-07-20 06:03:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:03:12,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:12,884 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:12,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:13,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-20 06:03:13,100 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:13,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:13,100 INFO L85 PathProgramCache]: Analyzing trace with hash 180762931, now seen corresponding path program 1 times [2022-07-20 06:03:13,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:13,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258946881] [2022-07-20 06:03:13,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:13,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258946881] [2022-07-20 06:03:13,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258946881] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:13,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396750324] [2022-07-20 06:03:13,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:13,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:13,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:13,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:13,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 06:03:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:13,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 06:03:13,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:13,334 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-20 06:03:13,338 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-20 06:03:13,366 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:03:13,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:13,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:13,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:13,393 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:03:13,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:13,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:13,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:13,467 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-20 06:03:13,471 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-20 06:03:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:13,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:13,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396750324] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:13,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:13,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2022-07-20 06:03:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584226622] [2022-07-20 06:03:13,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:13,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:03:13,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:03:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:03:13,569 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:13,961 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2022-07-20 06:03:13,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:03:13,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 06:03:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:13,965 INFO L225 Difference]: With dead ends: 181 [2022-07-20 06:03:13,965 INFO L226 Difference]: Without dead ends: 181 [2022-07-20 06:03:13,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:03:13,966 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 78 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:13,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 468 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:03:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-20 06:03:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 144. [2022-07-20 06:03:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 143 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2022-07-20 06:03:13,969 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 30 [2022-07-20 06:03:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:13,969 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2022-07-20 06:03:13,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2022-07-20 06:03:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:03:13,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:13,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:13,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 06:03:14,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:14,170 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1308683207, now seen corresponding path program 1 times [2022-07-20 06:03:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:14,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875574604] [2022-07-20 06:03:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:14,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:14,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875574604] [2022-07-20 06:03:14,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875574604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:14,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729129147] [2022-07-20 06:03:14,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:14,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:14,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:14,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:14,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 06:03:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:14,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:03:14,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:14,369 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 13 treesize of output 9 [2022-07-20 06:03:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:14,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:14,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729129147] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:14,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:14,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-07-20 06:03:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834078009] [2022-07-20 06:03:14,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:14,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:14,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:14,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:14,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:14,427 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:14,505 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-07-20 06:03:14,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:03:14,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 06:03:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:14,506 INFO L225 Difference]: With dead ends: 152 [2022-07-20 06:03:14,506 INFO L226 Difference]: Without dead ends: 129 [2022-07-20 06:03:14,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:14,507 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:14,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-07-20 06:03:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-20 06:03:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-20 06:03:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.280373831775701) internal successors, (137), 128 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2022-07-20 06:03:14,510 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 31 [2022-07-20 06:03:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:14,511 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2022-07-20 06:03:14,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-07-20 06:03:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:03:14,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:14,512 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:14,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:14,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:14,736 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash 929038273, now seen corresponding path program 1 times [2022-07-20 06:03:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:14,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729918349] [2022-07-20 06:03:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:14,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:15,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729918349] [2022-07-20 06:03:15,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729918349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:15,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723579543] [2022-07-20 06:03:15,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:15,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:15,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:15,014 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:15,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 06:03:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:15,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 06:03:15,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:15,146 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-20 06:03:15,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:03:15,193 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:03:15,193 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-20 06:03:15,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:03:15,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:15,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:15,281 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:15,284 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 29 treesize of output 30 [2022-07-20 06:03:15,289 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-20 06:03:15,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 06:03:15,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:03:15,347 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-20 06:03:15,398 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-20 06:03:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:15,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:15,453 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-20 06:03:15,466 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-20 06:03:15,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-20 06:03:15,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_915 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_913) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_912) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-20 06:03:15,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_915 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_913) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_912) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_915)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-20 06:03:15,499 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:15,500 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-20 06:03:15,503 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 70 treesize of output 62 [2022-07-20 06:03:15,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-20 06:03:15,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_arrayElimCell_28 Int) (v_ArrVal_915 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_908))) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (or (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (and .cse0 (= ~unnamed1~0~BLACK (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_913) v_arrayElimCell_28 v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))) is different from false [2022-07-20 06:03:16,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-20 06:03:16,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:03:16,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:16,124 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:03:16,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 1 [2022-07-20 06:03:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:16,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723579543] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:16,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:16,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2022-07-20 06:03:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770254549] [2022-07-20 06:03:16,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:16,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 06:03:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:16,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 06:03:16,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=305, Unknown=10, NotChecked=246, Total=650 [2022-07-20 06:03:16,162 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:16,820 INFO L93 Difference]: Finished difference Result 221 states and 236 transitions. [2022-07-20 06:03:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:03:16,821 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-20 06:03:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:16,823 INFO L225 Difference]: With dead ends: 221 [2022-07-20 06:03:16,823 INFO L226 Difference]: Without dead ends: 221 [2022-07-20 06:03:16,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=691, Unknown=10, NotChecked=378, Total=1332 [2022-07-20 06:03:16,824 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 515 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1183 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:16,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 525 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 609 Invalid, 0 Unknown, 1183 Unchecked, 0.4s Time] [2022-07-20 06:03:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-20 06:03:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 155. [2022-07-20 06:03:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.2406015037593985) internal successors, (165), 154 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2022-07-20 06:03:16,830 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 35 [2022-07-20 06:03:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:16,831 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2022-07-20 06:03:16,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2022-07-20 06:03:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:03:16,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:16,832 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:16,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:17,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 06:03:17,044 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 899162440, now seen corresponding path program 1 times [2022-07-20 06:03:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:17,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786796697] [2022-07-20 06:03:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:17,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786796697] [2022-07-20 06:03:17,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786796697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706885970] [2022-07-20 06:03:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:17,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:17,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:17,228 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:17,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 06:03:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:17,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-20 06:03:17,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:17,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:03:17,434 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:03:17,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:03:17,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:03:17,579 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:17,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:03:17,656 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:17,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:03:17,699 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:17,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:03:17,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:17,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:03:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:17,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:18,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:18,331 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 31 [2022-07-20 06:03:18,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:18,338 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 252 treesize of output 227 [2022-07-20 06:03:18,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-07-20 06:03:18,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:18,356 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 204 treesize of output 196 [2022-07-20 06:03:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:23,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706885970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:23,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:23,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 33 [2022-07-20 06:03:23,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852030597] [2022-07-20 06:03:23,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:23,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 06:03:23,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:23,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 06:03:23,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=940, Unknown=21, NotChecked=0, Total=1122 [2022-07-20 06:03:23,335 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:23,996 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2022-07-20 06:03:23,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:03:23,997 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:03:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:23,998 INFO L225 Difference]: With dead ends: 231 [2022-07-20 06:03:23,998 INFO L226 Difference]: Without dead ends: 231 [2022-07-20 06:03:23,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=282, Invalid=1337, Unknown=21, NotChecked=0, Total=1640 [2022-07-20 06:03:23,999 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 493 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 907 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:23,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 751 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 847 Invalid, 0 Unknown, 907 Unchecked, 0.5s Time] [2022-07-20 06:03:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-20 06:03:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 163. [2022-07-20 06:03:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 162 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2022-07-20 06:03:24,003 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 42 [2022-07-20 06:03:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:24,003 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2022-07-20 06:03:24,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2022-07-20 06:03:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:03:24,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:24,004 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:24,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:24,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:24,228 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash 899162441, now seen corresponding path program 1 times [2022-07-20 06:03:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:24,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619194118] [2022-07-20 06:03:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:24,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:24,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619194118] [2022-07-20 06:03:24,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619194118] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:24,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999101672] [2022-07-20 06:03:24,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:24,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:24,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:24,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:24,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 06:03:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:24,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 06:03:24,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:24,574 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-20 06:03:24,626 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-20 06:03:24,649 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:03:24,650 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-20 06:03:24,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:03:24,679 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-20 06:03:24,758 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:24,758 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-20 06:03:24,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:03:24,843 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:24,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 06:03:24,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:03:24,872 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:24,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:03:24,928 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:24,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:03:24,934 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-20 06:03:25,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:25,097 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 15 treesize of output 7 [2022-07-20 06:03:25,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:25,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:25,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-07-20 06:03:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:25,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:25,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_86| Int)) (or (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86|))) (and (<= (+ .cse0 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86|))) (<= 0 (+ .cse0 8)))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_86| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-20 06:03:25,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_86| Int) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (or (and (forall ((v_ArrVal_1118 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1114) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1118) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86|) 8))) (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1117 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1113))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1114) .cse0 v_ArrVal_1118) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1117) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86|))))))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_86| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-20 06:03:26,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:26,239 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-20 06:03:26,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:26,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-20 06:03:26,248 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 54 treesize of output 46 [2022-07-20 06:03:26,259 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:26,259 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 186 treesize of output 181 [2022-07-20 06:03:26,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 156 [2022-07-20 06:03:26,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2022-07-20 06:03:26,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2022-07-20 06:03:26,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:26,352 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 73 treesize of output 74 [2022-07-20 06:03:26,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:26,358 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 65 treesize of output 50 [2022-07-20 06:03:26,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:26,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:26,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-07-20 06:03:26,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:26,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-20 06:03:26,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-07-20 06:03:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:26,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999101672] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:26,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:26,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 36 [2022-07-20 06:03:26,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13699168] [2022-07-20 06:03:26,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:26,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 06:03:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 06:03:26,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1053, Unknown=27, NotChecked=134, Total=1332 [2022-07-20 06:03:26,630 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:28,176 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2022-07-20 06:03:28,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 06:03:28,176 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 0 states have call successors, (0), 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 42 [2022-07-20 06:03:28,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:28,177 INFO L225 Difference]: With dead ends: 227 [2022-07-20 06:03:28,177 INFO L226 Difference]: Without dead ends: 227 [2022-07-20 06:03:28,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=382, Invalid=2461, Unknown=27, NotChecked=210, Total=3080 [2022-07-20 06:03:28,179 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 432 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 830 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:28,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 790 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 884 Invalid, 0 Unknown, 830 Unchecked, 0.5s Time] [2022-07-20 06:03:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-20 06:03:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 166. [2022-07-20 06:03:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 165 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2022-07-20 06:03:28,193 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 42 [2022-07-20 06:03:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:28,193 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2022-07-20 06:03:28,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2022-07-20 06:03:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:03:28,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:28,194 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:28,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:28,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:28,407 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1421280140, now seen corresponding path program 1 times [2022-07-20 06:03:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274933996] [2022-07-20 06:03:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:28,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:28,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274933996] [2022-07-20 06:03:28,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274933996] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:28,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273171625] [2022-07-20 06:03:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:28,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:28,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:28,893 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:28,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 06:03:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:29,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 06:03:29,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:29,047 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-20 06:03:29,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:03:29,121 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:03:29,121 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-20 06:03:29,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:29,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:29,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:03:29,257 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:29,258 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 29 treesize of output 30 [2022-07-20 06:03:29,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:03:29,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 06:03:29,327 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-20 06:03:29,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:03:29,366 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 06:03:29,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:03:29,375 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-20 06:03:29,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:03:29,454 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:29,455 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 1 case distinctions, treesize of input 37 treesize of output 36 [2022-07-20 06:03:29,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 06:03:29,486 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 24 treesize of output 12 [2022-07-20 06:03:29,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:03:29,506 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-20 06:03:29,574 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-20 06:03:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:29,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:29,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-20 06:03:29,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-20 06:03:29,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-20 06:03:29,635 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1278) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1277) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-20 06:03:29,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1278) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1277) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1280)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-20 06:03:29,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:29,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-20 06:03:29,654 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 60 treesize of output 52 [2022-07-20 06:03:29,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-20 06:03:29,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_arrayElimCell_82 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1274)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (or (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (and .cse0 (= ~unnamed1~0~BLACK (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1278) v_arrayElimCell_82 v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))) is different from false [2022-07-20 06:03:30,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:30,265 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 63 treesize of output 55 [2022-07-20 06:03:30,269 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 104 treesize of output 92 [2022-07-20 06:03:30,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-07-20 06:03:30,319 INFO L356 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-07-20 06:03:30,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2022-07-20 06:03:30,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int) (v_ArrVal_1269 Int) (v_ArrVal_1274 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (or (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_arrayElimCell_84) .cse0) (and .cse0 (forall ((v_ArrVal_1270 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1269)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1270) v_arrayElimCell_84 v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |c_ULTIMATE.start_main_~end~0#1.base|) (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1269)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))))) is different from false [2022-07-20 06:03:36,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:36,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:36,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 56 [2022-07-20 06:03:36,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:36,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 141 [2022-07-20 06:03:36,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-20 06:03:36,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 24 [2022-07-20 06:03:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:36,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273171625] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:36,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:36,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 45 [2022-07-20 06:03:36,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738089554] [2022-07-20 06:03:36,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:36,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 06:03:36,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:36,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 06:03:36,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1157, Unknown=30, NotChecked=546, Total=1980 [2022-07-20 06:03:36,114 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand has 45 states, 45 states have (on average 2.3333333333333335) internal successors, (105), 45 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:37,158 INFO L93 Difference]: Finished difference Result 425 states and 457 transitions. [2022-07-20 06:03:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 06:03:37,159 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.3333333333333335) internal successors, (105), 45 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-20 06:03:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:37,161 INFO L225 Difference]: With dead ends: 425 [2022-07-20 06:03:37,161 INFO L226 Difference]: Without dead ends: 425 [2022-07-20 06:03:37,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=530, Invalid=2438, Unknown=30, NotChecked=784, Total=3782 [2022-07-20 06:03:37,163 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 478 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 3630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2519 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:37,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1120 Invalid, 3630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1017 Invalid, 0 Unknown, 2519 Unchecked, 0.5s Time] [2022-07-20 06:03:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-07-20 06:03:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 192. [2022-07-20 06:03:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 170 states have (on average 1.2058823529411764) internal successors, (205), 191 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2022-07-20 06:03:37,169 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 45 [2022-07-20 06:03:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:37,169 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2022-07-20 06:03:37,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.3333333333333335) internal successors, (105), 45 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2022-07-20 06:03:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:03:37,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:37,170 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:37,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:37,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-20 06:03:37,391 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:03:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:37,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1605357382, now seen corresponding path program 2 times [2022-07-20 06:03:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:37,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907106864] [2022-07-20 06:03:37,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:37,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:37,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:37,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907106864] [2022-07-20 06:03:37,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907106864] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:37,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121493307] [2022-07-20 06:03:37,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:03:37,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:37,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:37,666 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:37,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 06:03:37,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:03:37,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:03:37,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 06:03:37,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:37,902 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 06:03:37,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-07-20 06:03:37,925 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 06:03:37,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-07-20 06:03:37,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:37,989 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 29 treesize of output 28 [2022-07-20 06:03:37,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:37,996 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 29 treesize of output 28 [2022-07-20 06:03:38,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:38,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:38,672 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-07-20 06:03:38,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 64 [2022-07-20 06:03:38,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:38,686 INFO L356 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-07-20 06:03:38,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 40 [2022-07-20 06:03:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:38,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:42,833 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:42,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 4247 treesize of output 3133 [2022-07-20 06:03:43,491 INFO L356 Elim1Store]: treesize reduction 198, result has 64.1 percent of original size [2022-07-20 06:03:43,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 12176 treesize of output 8581 [2022-07-20 06:04:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:42,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121493307] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:42,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:42,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 40 [2022-07-20 06:04:42,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894015200] [2022-07-20 06:04:42,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:42,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 06:04:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:42,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 06:04:42,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1425, Unknown=1, NotChecked=0, Total=1560 [2022-07-20 06:04:42,680 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand has 40 states, 40 states have (on average 3.25) internal successors, (130), 40 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:43,720 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2022-07-20 06:04:43,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:04:43,720 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.25) internal successors, (130), 40 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-20 06:04:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:43,721 INFO L225 Difference]: With dead ends: 208 [2022-07-20 06:04:43,721 INFO L226 Difference]: Without dead ends: 208 [2022-07-20 06:04:43,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=388, Invalid=2691, Unknown=1, NotChecked=0, Total=3080 [2022-07-20 06:04:43,722 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 383 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 488 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:43,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1043 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1066 Invalid, 0 Unknown, 488 Unchecked, 0.5s Time] [2022-07-20 06:04:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-20 06:04:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 194. [2022-07-20 06:04:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 172 states have (on average 1.2034883720930232) internal successors, (207), 193 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 207 transitions. [2022-07-20 06:04:43,726 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 207 transitions. Word has length 47 [2022-07-20 06:04:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:43,726 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 207 transitions. [2022-07-20 06:04:43,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.25) internal successors, (130), 40 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 207 transitions. [2022-07-20 06:04:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:04:43,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:43,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:04:43,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-20 06:04:43,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-20 06:04:43,927 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:04:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1563339129, now seen corresponding path program 1 times [2022-07-20 06:04:43,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:43,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046581646] [2022-07-20 06:04:43,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:43,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:44,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:44,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046581646] [2022-07-20 06:04:44,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046581646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:44,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003177534] [2022-07-20 06:04:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:44,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:44,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:44,376 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:04:44,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 06:04:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:44,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 06:04:44,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:44,500 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-20 06:04:44,525 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:04:44,525 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-20 06:04:44,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:04:44,547 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-20 06:04:44,591 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:44,592 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 29 treesize of output 30 [2022-07-20 06:04:44,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:04:44,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:04:44,635 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-20 06:04:44,663 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:44,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-07-20 06:04:44,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:04:44,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-20 06:04:44,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:44,832 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 15 treesize of output 7 [2022-07-20 06:04:44,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:44,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:44,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2022-07-20 06:04:44,885 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-20 06:04:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:44,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:45,132 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 82 treesize of output 62 [2022-07-20 06:04:45,165 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_131 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_104| Int) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_104|)) (not (= v_arrayElimCell_131 ~unnamed1~0~RED)) (and (= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_104|) 8) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_104|) |c_ULTIMATE.start_main_~end~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_104| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-20 06:04:45,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_104| Int) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_104|)) (and (= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_104|) 8) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_104|) |c_ULTIMATE.start_main_~end~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_104| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-20 06:04:45,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:45,719 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 55 treesize of output 56 [2022-07-20 06:04:45,724 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 104 treesize of output 96 [2022-07-20 06:04:45,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 44 [2022-07-20 06:04:45,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:45,771 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 51 treesize of output 36 [2022-07-20 06:04:45,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:45,780 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 330 treesize of output 265 [2022-07-20 06:04:45,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:45,791 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 250 treesize of output 222 [2022-07-20 06:04:45,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 198 [2022-07-20 06:04:46,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:46,319 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 118 treesize of output 86 [2022-07-20 06:04:46,348 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 33 treesize of output 25 [2022-07-20 06:04:46,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:04:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:46,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003177534] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:46,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:46,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14, 17] total 44 [2022-07-20 06:04:46,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400588164] [2022-07-20 06:04:46,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:46,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-20 06:04:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-20 06:04:46,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1557, Unknown=31, NotChecked=162, Total=1892 [2022-07-20 06:04:46,562 INFO L87 Difference]: Start difference. First operand 194 states and 207 transitions. Second operand has 44 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 44 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:47,870 INFO L93 Difference]: Finished difference Result 229 states and 243 transitions. [2022-07-20 06:04:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:04:47,870 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 44 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-20 06:04:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:47,871 INFO L225 Difference]: With dead ends: 229 [2022-07-20 06:04:47,872 INFO L226 Difference]: Without dead ends: 229 [2022-07-20 06:04:47,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=424, Invalid=2975, Unknown=31, NotChecked=230, Total=3660 [2022-07-20 06:04:47,873 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 411 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1023 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:47,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1223 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1591 Invalid, 0 Unknown, 1023 Unchecked, 0.7s Time] [2022-07-20 06:04:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-20 06:04:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 193. [2022-07-20 06:04:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 171 states have (on average 1.1988304093567252) internal successors, (205), 192 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2022-07-20 06:04:47,878 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 47 [2022-07-20 06:04:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:47,878 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2022-07-20 06:04:47,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 44 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2022-07-20 06:04:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 06:04:47,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:47,879 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:04:47,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:04:48,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-20 06:04:48,096 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:04:48,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash 334775830, now seen corresponding path program 1 times [2022-07-20 06:04:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:48,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85378568] [2022-07-20 06:04:48,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:48,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:48,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:48,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85378568] [2022-07-20 06:04:48,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85378568] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:48,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972233670] [2022-07-20 06:04:48,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:48,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:48,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:48,286 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:04:48,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 06:04:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:48,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-20 06:04:48,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:48,580 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 06:04:48,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-07-20 06:04:48,598 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:04:48,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 06:04:48,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:04:48,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:48,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-20 06:04:48,677 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:04:48,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-20 06:04:48,851 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 7 treesize of output 3 [2022-07-20 06:04:48,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, 1 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-20 06:04:48,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-20 06:04:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:48,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:49,177 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-20 06:04:49,179 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 21 treesize of output 16 [2022-07-20 06:04:49,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1585 Int) (v_ArrVal_1584 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_112| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8) v_ArrVal_1585)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_112|) 0)) (= |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_112|) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_112|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_112|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_112| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-20 06:04:49,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:49,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 306 treesize of output 249 [2022-07-20 06:04:49,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:49,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 206 [2022-07-20 06:04:49,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-20 06:04:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:49,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972233670] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:49,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:49,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 36 [2022-07-20 06:04:49,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60634183] [2022-07-20 06:04:49,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:49,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 06:04:49,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 06:04:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1035, Unknown=1, NotChecked=66, Total=1260 [2022-07-20 06:04:49,744 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:51,204 INFO L93 Difference]: Finished difference Result 310 states and 328 transitions. [2022-07-20 06:04:51,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-20 06:04:51,204 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-20 06:04:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:51,205 INFO L225 Difference]: With dead ends: 310 [2022-07-20 06:04:51,206 INFO L226 Difference]: Without dead ends: 310 [2022-07-20 06:04:51,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 83 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=891, Invalid=3942, Unknown=1, NotChecked=136, Total=4970 [2022-07-20 06:04:51,208 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 603 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:51,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 930 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1201 Invalid, 0 Unknown, 415 Unchecked, 0.6s Time] [2022-07-20 06:04:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-20 06:04:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 196. [2022-07-20 06:04:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 174 states have (on average 1.1839080459770115) internal successors, (206), 195 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 206 transitions. [2022-07-20 06:04:51,212 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 206 transitions. Word has length 50 [2022-07-20 06:04:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:51,213 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 206 transitions. [2022-07-20 06:04:51,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 206 transitions. [2022-07-20 06:04:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 06:04:51,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:51,214 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:04:51,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:04:51,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:51,427 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-20 06:04:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:51,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1149873379, now seen corresponding path program 1 times [2022-07-20 06:04:51,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:51,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334158435] [2022-07-20 06:04:51,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:51,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:51,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334158435] [2022-07-20 06:04:51,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334158435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:51,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148042713] [2022-07-20 06:04:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:51,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:51,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:51,931 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:04:51,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 06:04:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:52,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-20 06:04:52,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:52,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 06:04:52,129 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:04:52,129 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-20 06:04:52,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:04:52,216 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:52,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:04:52,290 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:52,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-20 06:04:52,337 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:52,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-20 06:04:52,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:52,357 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 06:04:52,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:04:52,391 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 06:04:52,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-20 06:04:52,497 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 06:04:52,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 44 [2022-07-20 06:04:52,602 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 06:04:52,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 53 [2022-07-20 06:04:52,632 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 06:04:52,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-07-20 06:04:52,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:52,858 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-07-20 06:04:52,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 27 [2022-07-20 06:04:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:52,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:53,306 INFO L356 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2022-07-20 06:04:53,306 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 45 treesize of output 44 [2022-07-20 06:04:53,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_118| Int) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_118|)) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1738))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1740)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_118|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_118| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-20 06:04:53,380 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:53,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-20 06:04:53,392 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_118| Int) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_118|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_118| |c_ULTIMATE.start_main_~list~0#1.offset|)) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1738))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1740)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_118|) |c_ULTIMATE.start_main_~end~0#1.base|)))) is different from false [2022-07-20 06:04:53,710 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:53,710 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 134 treesize of output 86 [2022-07-20 06:04:53,732 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:53,733 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 16694 treesize of output 13737 [2022-07-20 06:04:53,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:53,861 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 13722 treesize of output 12248 [2022-07-20 06:04:53,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:53,937 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 12218 treesize of output 11578 [2022-07-20 06:04:54,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11570 treesize of output 11058 [2022-07-20 06:04:54,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:54,101 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 11066 treesize of output 9208 [2022-07-20 06:04:54,191 INFO L356 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-07-20 06:04:54,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61