./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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-sentinel-2.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 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:14:26,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:14:26,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:14:27,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:14:27,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:14:27,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:14:27,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:14:27,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:14:27,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:14:27,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:14:27,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:14:27,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:14:27,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:14:27,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:14:27,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:14:27,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:14:27,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:14:27,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:14:27,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:14:27,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:14:27,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:14:27,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:14:27,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:14:27,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:14:27,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:14:27,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:14:27,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:14:27,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:14:27,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:14:27,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:14:27,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:14:27,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:14:27,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:14:27,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:14:27,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:14:27,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:14:27,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:14:27,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:14:27,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:14:27,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:14:27,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:14:27,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:14:27,087 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:14:27,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:14:27,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:14:27,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:14:27,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:14:27,088 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:14:27,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:14:27,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:14:27,089 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:14:27,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:14:27,090 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:14:27,090 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:14:27,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:14:27,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:14:27,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:14:27,091 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:14:27,091 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:14:27,091 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:14:27,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:14:27,091 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:14:27,091 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:14:27,092 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:14:27,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:14:27,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:14:27,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:14:27,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:14:27,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:14:27,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:14:27,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:14:27,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:14:27,093 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:14:27,093 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:14:27,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:14:27,094 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:14:27,094 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2023-02-15 22:14:27,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:14:27,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:14:27,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:14:27,322 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:14:27,322 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:14:27,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2023-02-15 22:14:28,333 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:14:28,549 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:14:28,550 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2023-02-15 22:14:28,566 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c512ff7b3/be2caa6e36b4421897e745ee860b401b/FLAG927c8b949 [2023-02-15 22:14:28,584 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c512ff7b3/be2caa6e36b4421897e745ee860b401b [2023-02-15 22:14:28,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:14:28,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:14:28,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:14:28,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:14:28,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:14:28,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:28,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e7e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28, skipping insertion in model container [2023-02-15 22:14:28,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:28,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:14:28,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:14:28,829 WARN L237 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-sentinel-2.i[22673,22686] [2023-02-15 22:14:28,834 WARN L237 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-sentinel-2.i[22743,22756] [2023-02-15 22:14:28,835 WARN L237 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-sentinel-2.i[22807,22820] [2023-02-15 22:14:28,836 WARN L237 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-sentinel-2.i[22902,22915] [2023-02-15 22:14:28,838 WARN L237 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-sentinel-2.i[22974,22987] [2023-02-15 22:14:28,839 WARN L237 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-sentinel-2.i[23113,23126] [2023-02-15 22:14:28,840 WARN L237 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-sentinel-2.i[23187,23200] [2023-02-15 22:14:28,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:14:28,855 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:14:28,892 WARN L237 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-sentinel-2.i[22673,22686] [2023-02-15 22:14:28,894 WARN L237 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-sentinel-2.i[22743,22756] [2023-02-15 22:14:28,894 WARN L237 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-sentinel-2.i[22807,22820] [2023-02-15 22:14:28,897 WARN L237 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-sentinel-2.i[22902,22915] [2023-02-15 22:14:28,898 WARN L237 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-sentinel-2.i[22974,22987] [2023-02-15 22:14:28,900 WARN L237 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-sentinel-2.i[23113,23126] [2023-02-15 22:14:28,900 WARN L237 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-sentinel-2.i[23187,23200] [2023-02-15 22:14:28,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:14:28,925 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:14:28,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28 WrapperNode [2023-02-15 22:14:28,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:14:28,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:14:28,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:14:28,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:14:28,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:28,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:28,975 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2023-02-15 22:14:28,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:14:28,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:14:28,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:14:28,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:14:28,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:28,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:28,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:28,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:29,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:29,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:29,005 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:29,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:29,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:14:29,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:14:29,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:14:29,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:14:29,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (1/1) ... [2023-02-15 22:14:29,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:14:29,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:29,045 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) [2023-02-15 22:14:29,064 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 [2023-02-15 22:14:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:14:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:14:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:14:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:14:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:14:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:14:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:14:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:14:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:14:29,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:14:29,219 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:14:29,220 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:14:29,654 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:14:29,659 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:14:29,659 INFO L300 CfgBuilder]: Removed 17 assume(true) statements. [2023-02-15 22:14:29,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:14:29 BoogieIcfgContainer [2023-02-15 22:14:29,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:14:29,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:14:29,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:14:29,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:14:29,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:14:28" (1/3) ... [2023-02-15 22:14:29,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c8627e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:14:29, skipping insertion in model container [2023-02-15 22:14:29,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:28" (2/3) ... [2023-02-15 22:14:29,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c8627e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:14:29, skipping insertion in model container [2023-02-15 22:14:29,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:14:29" (3/3) ... [2023-02-15 22:14:29,675 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2023-02-15 22:14:29,686 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:14:29,687 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2023-02-15 22:14:29,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:14:29,720 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59118c67, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:14:29,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2023-02-15 22:14:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 90 states have (on average 2.2222222222222223) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:14:29,726 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:29,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:14:29,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 22:14:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:29,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347174435] [2023-02-15 22:14:29,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:29,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:29,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347174435] [2023-02-15 22:14:29,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347174435] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:29,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:29,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:14:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000072627] [2023-02-15 22:14:29,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:29,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:14:29,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:29,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:14:29,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:14:29,906 INFO L87 Difference]: Start difference. First operand has 171 states, 90 states have (on average 2.2222222222222223) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 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) [2023-02-15 22:14:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:30,085 INFO L93 Difference]: Finished difference Result 198 states and 205 transitions. [2023-02-15 22:14:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:14:30,087 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 [2023-02-15 22:14:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:30,099 INFO L225 Difference]: With dead ends: 198 [2023-02-15 22:14:30,099 INFO L226 Difference]: Without dead ends: 196 [2023-02-15 22:14:30,100 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 [2023-02-15 22:14:30,102 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 151 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:30,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 117 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-15 22:14:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2023-02-15 22:14:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 93 states have (on average 1.913978494623656) internal successors, (178), 169 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) [2023-02-15 22:14:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 178 transitions. [2023-02-15 22:14:30,134 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 178 transitions. Word has length 3 [2023-02-15 22:14:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:30,134 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 178 transitions. [2023-02-15 22:14:30,134 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) [2023-02-15 22:14:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 178 transitions. [2023-02-15 22:14:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:14:30,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:30,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:14:30,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:14:30,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 22:14:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:30,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458759666] [2023-02-15 22:14:30,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:30,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:30,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458759666] [2023-02-15 22:14:30,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458759666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:30,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:30,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:14:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027750516] [2023-02-15 22:14:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:30,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:14:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:30,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:14:30,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:14:30,192 INFO L87 Difference]: Start difference. First operand 170 states and 178 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) [2023-02-15 22:14:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:30,283 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2023-02-15 22:14:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:14:30,283 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 [2023-02-15 22:14:30,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:30,284 INFO L225 Difference]: With dead ends: 166 [2023-02-15 22:14:30,284 INFO L226 Difference]: Without dead ends: 166 [2023-02-15 22:14:30,285 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 [2023-02-15 22:14:30,286 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:30,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 90 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-15 22:14:30,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-02-15 22:14:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2023-02-15 22:14:30,292 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 3 [2023-02-15 22:14:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:30,292 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2023-02-15 22:14:30,292 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) [2023-02-15 22:14:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2023-02-15 22:14:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:14:30,293 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:30,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:30,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:14:30,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2023-02-15 22:14:30,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:30,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209005846] [2023-02-15 22:14:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:30,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:30,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209005846] [2023-02-15 22:14:30,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209005846] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:30,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:30,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:14:30,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255331690] [2023-02-15 22:14:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:30,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:14:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:30,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:14:30,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:14:30,341 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:30,416 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2023-02-15 22:14:30,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:14:30,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-02-15 22:14:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:30,417 INFO L225 Difference]: With dead ends: 162 [2023-02-15 22:14:30,417 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 22:14:30,417 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 [2023-02-15 22:14:30,418 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 136 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:30,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 103 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 22:14:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2023-02-15 22:14:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 94 states have (on average 1.7872340425531914) internal successors, (168), 159 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) [2023-02-15 22:14:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2023-02-15 22:14:30,424 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 7 [2023-02-15 22:14:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:30,424 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2023-02-15 22:14:30,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2023-02-15 22:14:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:14:30,425 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:30,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:14:30,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2023-02-15 22:14:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446224129] [2023-02-15 22:14:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:30,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:30,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446224129] [2023-02-15 22:14:30,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446224129] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:30,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:30,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:14:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733139514] [2023-02-15 22:14:30,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:30,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:14:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:30,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:14:30,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:14:30,497 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:30,586 INFO L93 Difference]: Finished difference Result 177 states and 183 transitions. [2023-02-15 22:14:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:14:30,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-02-15 22:14:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:30,587 INFO L225 Difference]: With dead ends: 177 [2023-02-15 22:14:30,588 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 22:14:30,588 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 [2023-02-15 22:14:30,589 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 134 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:30,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 112 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 22:14:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2023-02-15 22:14:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 101 states have (on average 1.702970297029703) internal successors, (172), 163 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2023-02-15 22:14:30,594 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 7 [2023-02-15 22:14:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:30,594 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2023-02-15 22:14:30,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2023-02-15 22:14:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:14:30,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:30,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:30,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:14:30,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214510, now seen corresponding path program 1 times [2023-02-15 22:14:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:30,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262503439] [2023-02-15 22:14:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:30,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:30,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262503439] [2023-02-15 22:14:30,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262503439] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:30,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:30,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:14:30,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404184947] [2023-02-15 22:14:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:30,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:14:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:30,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:14:30,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:14:30,705 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:30,824 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2023-02-15 22:14:30,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:14:30,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-02-15 22:14:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:30,826 INFO L225 Difference]: With dead ends: 164 [2023-02-15 22:14:30,826 INFO L226 Difference]: Without dead ends: 164 [2023-02-15 22:14:30,826 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 [2023-02-15 22:14:30,827 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 218 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:30,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 89 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-15 22:14:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2023-02-15 22:14:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.5631067961165048) internal successors, (161), 150 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) [2023-02-15 22:14:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2023-02-15 22:14:30,831 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 13 [2023-02-15 22:14:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:30,831 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2023-02-15 22:14:30,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2023-02-15 22:14:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:14:30,832 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:30,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:30,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:14:30,833 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:30,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:30,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214511, now seen corresponding path program 1 times [2023-02-15 22:14:30,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:30,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549252322] [2023-02-15 22:14:30,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:30,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:30,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549252322] [2023-02-15 22:14:30,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549252322] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:30,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:30,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:14:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299938485] [2023-02-15 22:14:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:30,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:14:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:14:30,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:14:30,949 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:31,109 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2023-02-15 22:14:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:14:31,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-02-15 22:14:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:31,110 INFO L225 Difference]: With dead ends: 193 [2023-02-15 22:14:31,110 INFO L226 Difference]: Without dead ends: 193 [2023-02-15 22:14:31,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:14:31,111 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 188 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:31,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 133 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-02-15 22:14:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2023-02-15 22:14:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 114 states have (on average 1.5263157894736843) 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) [2023-02-15 22:14:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2023-02-15 22:14:31,115 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 13 [2023-02-15 22:14:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:31,116 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2023-02-15 22:14:31,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2023-02-15 22:14:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:14:31,116 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:31,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:31,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:14:31,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:31,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:31,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1748354145, now seen corresponding path program 1 times [2023-02-15 22:14:31,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:31,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554482615] [2023-02-15 22:14:31,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:31,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:31,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554482615] [2023-02-15 22:14:31,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554482615] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:31,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:31,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:14:31,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560532926] [2023-02-15 22:14:31,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:31,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:14:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:31,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:14:31,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:14:31,173 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:31,323 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2023-02-15 22:14:31,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:14:31,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 22:14:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:31,325 INFO L225 Difference]: With dead ends: 202 [2023-02-15 22:14:31,325 INFO L226 Difference]: Without dead ends: 202 [2023-02-15 22:14:31,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:14:31,326 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 309 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:31,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 157 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-15 22:14:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2023-02-15 22:14:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 161 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) [2023-02-15 22:14:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2023-02-15 22:14:31,330 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 15 [2023-02-15 22:14:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:31,330 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2023-02-15 22:14:31,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2023-02-15 22:14:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:14:31,331 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:31,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:31,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:14:31,332 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230725, now seen corresponding path program 1 times [2023-02-15 22:14:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:31,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268516550] [2023-02-15 22:14:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:31,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:31,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268516550] [2023-02-15 22:14:31,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268516550] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:31,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:31,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:14:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206844238] [2023-02-15 22:14:31,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:31,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:14:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:31,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:14:31,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:14:31,410 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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) [2023-02-15 22:14:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:31,528 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2023-02-15 22:14:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:14:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 [2023-02-15 22:14:31,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:31,530 INFO L225 Difference]: With dead ends: 161 [2023-02-15 22:14:31,530 INFO L226 Difference]: Without dead ends: 161 [2023-02-15 22:14:31,530 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 [2023-02-15 22:14:31,531 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 10 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:31,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 352 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-15 22:14:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-02-15 22:14:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2023-02-15 22:14:31,534 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 16 [2023-02-15 22:14:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:31,534 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2023-02-15 22:14:31,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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) [2023-02-15 22:14:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2023-02-15 22:14:31,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:14:31,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:31,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:31,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:14:31,535 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:31,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230724, now seen corresponding path program 1 times [2023-02-15 22:14:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:31,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652186355] [2023-02-15 22:14:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:31,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:31,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652186355] [2023-02-15 22:14:31,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652186355] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:31,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:31,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:14:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531337887] [2023-02-15 22:14:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:31,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:14:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:14:31,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:14:31,667 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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) [2023-02-15 22:14:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:31,793 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2023-02-15 22:14:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:14:31,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 [2023-02-15 22:14:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:31,794 INFO L225 Difference]: With dead ends: 160 [2023-02-15 22:14:31,794 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 22:14:31,794 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 [2023-02-15 22:14:31,795 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 5 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:31,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 343 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 22:14:31,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-02-15 22:14:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.4741379310344827) 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) [2023-02-15 22:14:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2023-02-15 22:14:31,798 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 16 [2023-02-15 22:14:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:31,798 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2023-02-15 22:14:31,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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) [2023-02-15 22:14:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2023-02-15 22:14:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 22:14:31,799 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:31,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:31,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:14:31,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:31,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash 154003716, now seen corresponding path program 1 times [2023-02-15 22:14:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:31,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240955452] [2023-02-15 22:14:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:31,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:31,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240955452] [2023-02-15 22:14:31,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240955452] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:31,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:31,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:14:31,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991086737] [2023-02-15 22:14:31,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:31,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:14:31,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:31,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:14:31,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:14:31,967 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:32,189 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2023-02-15 22:14:32,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:14:32,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 22:14:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:32,190 INFO L225 Difference]: With dead ends: 214 [2023-02-15 22:14:32,190 INFO L226 Difference]: Without dead ends: 214 [2023-02-15 22:14:32,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:14:32,191 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 337 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:32,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 327 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:14:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-15 22:14:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 165. [2023-02-15 22:14:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 164 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2023-02-15 22:14:32,194 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 18 [2023-02-15 22:14:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:32,194 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2023-02-15 22:14:32,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2023-02-15 22:14:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 22:14:32,194 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:32,194 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] [2023-02-15 22:14:32,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:14:32,195 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:32,195 INFO L85 PathProgramCache]: Analyzing trace with hash 510771581, now seen corresponding path program 1 times [2023-02-15 22:14:32,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:32,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526033589] [2023-02-15 22:14:32,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:32,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:32,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526033589] [2023-02-15 22:14:32,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526033589] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:32,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:32,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:14:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651486090] [2023-02-15 22:14:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:32,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:14:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:32,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:14:32,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:14:32,352 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:32,637 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2023-02-15 22:14:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:14:32,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 22:14:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:32,638 INFO L225 Difference]: With dead ends: 164 [2023-02-15 22:14:32,638 INFO L226 Difference]: Without dead ends: 164 [2023-02-15 22:14:32,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:14:32,639 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 186 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:32,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 325 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:14:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-15 22:14:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-02-15 22:14:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 163 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) [2023-02-15 22:14:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2023-02-15 22:14:32,642 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 20 [2023-02-15 22:14:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:32,642 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2023-02-15 22:14:32,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2023-02-15 22:14:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 22:14:32,642 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:32,642 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] [2023-02-15 22:14:32,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:14:32,643 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash 510771582, now seen corresponding path program 1 times [2023-02-15 22:14:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:32,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820591934] [2023-02-15 22:14:32,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:32,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:32,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820591934] [2023-02-15 22:14:32,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820591934] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:32,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:32,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:14:32,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555019596] [2023-02-15 22:14:32,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:32,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:14:32,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:32,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:14:32,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:14:32,873 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:33,302 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2023-02-15 22:14:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 22:14:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 22:14:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:33,303 INFO L225 Difference]: With dead ends: 182 [2023-02-15 22:14:33,303 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 22:14:33,303 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 [2023-02-15 22:14:33,304 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 237 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:33,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 391 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:14:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 22:14:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2023-02-15 22:14:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2023-02-15 22:14:33,306 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 20 [2023-02-15 22:14:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:33,307 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2023-02-15 22:14:33,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2023-02-15 22:14:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:14:33,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:33,307 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] [2023-02-15 22:14:33,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:14:33,307 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2006006511, now seen corresponding path program 1 times [2023-02-15 22:14:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:33,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42229026] [2023-02-15 22:14:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:33,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:33,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42229026] [2023-02-15 22:14:33,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42229026] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:33,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377438614] [2023-02-15 22:14:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:33,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:33,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:33,459 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) [2023-02-15 22:14:33,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:14:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:33,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 22:14:33,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:33,618 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:33,622 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:33,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:33,647 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:33,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:33,666 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:33,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:33,680 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:33,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:33,687 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:33,785 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:33,788 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:33,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:33,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377438614] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:14:33,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:14:33,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2023-02-15 22:14:33,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076475988] [2023-02-15 22:14:33,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:33,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:14:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:14:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:14:33,865 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 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) [2023-02-15 22:14:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:34,142 INFO L93 Difference]: Finished difference Result 219 states and 238 transitions. [2023-02-15 22:14:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:14:34,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 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 25 [2023-02-15 22:14:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:34,143 INFO L225 Difference]: With dead ends: 219 [2023-02-15 22:14:34,143 INFO L226 Difference]: Without dead ends: 219 [2023-02-15 22:14:34,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:14:34,144 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 348 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:34,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 424 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:14:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-15 22:14:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 175. [2023-02-15 22:14:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 174 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 191 transitions. [2023-02-15 22:14:34,147 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 191 transitions. Word has length 25 [2023-02-15 22:14:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:34,147 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 191 transitions. [2023-02-15 22:14:34,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 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) [2023-02-15 22:14:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 191 transitions. [2023-02-15 22:14:34,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:14:34,148 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:34,148 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] [2023-02-15 22:14:34,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 22:14:34,352 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,SelfDestructingSolverStorable12 [2023-02-15 22:14:34,353 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:34,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:34,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1963988258, now seen corresponding path program 1 times [2023-02-15 22:14:34,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:34,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949245773] [2023-02-15 22:14:34,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:34,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:34,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:34,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949245773] [2023-02-15 22:14:34,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949245773] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:34,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:34,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:14:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285026265] [2023-02-15 22:14:34,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:34,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:14:34,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:34,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:14:34,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:14:34,457 INFO L87 Difference]: Start difference. First operand 175 states and 191 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:34,556 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2023-02-15 22:14:34,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:14:34,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 22:14:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:34,557 INFO L225 Difference]: With dead ends: 179 [2023-02-15 22:14:34,557 INFO L226 Difference]: Without dead ends: 179 [2023-02-15 22:14:34,557 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 [2023-02-15 22:14:34,558 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 26 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:34,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 340 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:34,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-15 22:14:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2023-02-15 22:14:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 173 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2023-02-15 22:14:34,561 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 25 [2023-02-15 22:14:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:34,561 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2023-02-15 22:14:34,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2023-02-15 22:14:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:14:34,562 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:34,562 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] [2023-02-15 22:14:34,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 22:14:34,562 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1375479745, now seen corresponding path program 1 times [2023-02-15 22:14:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:34,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509685108] [2023-02-15 22:14:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:34,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:34,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509685108] [2023-02-15 22:14:34,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509685108] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:34,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:34,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:14:34,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918079663] [2023-02-15 22:14:34,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:34,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:14:34,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:34,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:14:34,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:14:34,622 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:34,692 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2023-02-15 22:14:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:14:34,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 22:14:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:34,693 INFO L225 Difference]: With dead ends: 176 [2023-02-15 22:14:34,693 INFO L226 Difference]: Without dead ends: 176 [2023-02-15 22:14:34,693 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 [2023-02-15 22:14:34,694 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 21 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:34,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 288 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-15 22:14:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2023-02-15 22:14:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 171 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) [2023-02-15 22:14:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2023-02-15 22:14:34,697 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 26 [2023-02-15 22:14:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:34,697 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2023-02-15 22:14:34,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2023-02-15 22:14:34,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 22:14:34,698 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:34,698 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] [2023-02-15 22:14:34,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 22:14:34,698 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash -752171090, now seen corresponding path program 1 times [2023-02-15 22:14:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:34,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201486113] [2023-02-15 22:14:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:34,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:34,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201486113] [2023-02-15 22:14:34,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201486113] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:34,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:34,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:14:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410273128] [2023-02-15 22:14:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:34,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:14:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:34,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:14:34,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:14:34,779 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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) [2023-02-15 22:14:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:34,888 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2023-02-15 22:14:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:14:34,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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 [2023-02-15 22:14:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:34,890 INFO L225 Difference]: With dead ends: 171 [2023-02-15 22:14:34,890 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 22:14:34,890 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 [2023-02-15 22:14:34,890 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 7 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:34,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 327 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 22:14:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-02-15 22:14:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 184 transitions. [2023-02-15 22:14:34,893 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 184 transitions. Word has length 28 [2023-02-15 22:14:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:34,893 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 184 transitions. [2023-02-15 22:14:34,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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) [2023-02-15 22:14:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 184 transitions. [2023-02-15 22:14:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 22:14:34,894 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:34,894 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] [2023-02-15 22:14:34,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 22:14:34,894 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash -752171089, now seen corresponding path program 1 times [2023-02-15 22:14:34,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:34,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166797157] [2023-02-15 22:14:34,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:34,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:35,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:35,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166797157] [2023-02-15 22:14:35,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166797157] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:35,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:35,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:14:35,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961071474] [2023-02-15 22:14:35,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:35,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:14:35,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:35,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:14:35,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:14:35,026 INFO L87 Difference]: Start difference. First operand 171 states and 184 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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) [2023-02-15 22:14:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:35,135 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2023-02-15 22:14:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:14:35,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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 [2023-02-15 22:14:35,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:35,136 INFO L225 Difference]: With dead ends: 170 [2023-02-15 22:14:35,136 INFO L226 Difference]: Without dead ends: 170 [2023-02-15 22:14:35,137 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 [2023-02-15 22:14:35,137 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 3 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:35,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 323 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-02-15 22:14:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2023-02-15 22:14:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 169 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2023-02-15 22:14:35,140 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 28 [2023-02-15 22:14:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:35,140 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2023-02-15 22:14:35,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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) [2023-02-15 22:14:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2023-02-15 22:14:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:14:35,140 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:35,140 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] [2023-02-15 22:14:35,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 22:14:35,141 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:35,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:35,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1361877815, now seen corresponding path program 1 times [2023-02-15 22:14:35,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:35,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822700204] [2023-02-15 22:14:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:35,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:35,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822700204] [2023-02-15 22:14:35,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822700204] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:35,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:35,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:14:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365197596] [2023-02-15 22:14:35,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:35,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:14:35,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:35,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:14:35,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:14:35,278 INFO L87 Difference]: Start difference. First operand 170 states and 183 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) [2023-02-15 22:14:35,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:35,356 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2023-02-15 22:14:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:14:35,357 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 [2023-02-15 22:14:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:35,357 INFO L225 Difference]: With dead ends: 169 [2023-02-15 22:14:35,357 INFO L226 Difference]: Without dead ends: 169 [2023-02-15 22:14:35,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:14:35,358 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 16 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:35,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 250 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:35,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-15 22:14:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2023-02-15 22:14:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 167 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2023-02-15 22:14:35,360 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 29 [2023-02-15 22:14:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:35,361 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2023-02-15 22:14:35,361 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) [2023-02-15 22:14:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2023-02-15 22:14:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:14:35,361 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:35,361 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] [2023-02-15 22:14:35,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 22:14:35,362 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1200575117, now seen corresponding path program 1 times [2023-02-15 22:14:35,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:35,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335153036] [2023-02-15 22:14:35,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:35,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:35,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335153036] [2023-02-15 22:14:35,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335153036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:35,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:35,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 22:14:35,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546888720] [2023-02-15 22:14:35,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:35,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:14:35,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:35,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:14:35,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:14:35,584 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:35,979 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2023-02-15 22:14:35,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:14:35,980 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 22:14:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:35,980 INFO L225 Difference]: With dead ends: 205 [2023-02-15 22:14:35,980 INFO L226 Difference]: Without dead ends: 205 [2023-02-15 22:14:35,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2023-02-15 22:14:35,981 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 491 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:35,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 299 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:14:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-15 22:14:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 168. [2023-02-15 22:14:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.325925925925926) internal successors, (179), 167 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2023-02-15 22:14:35,984 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 31 [2023-02-15 22:14:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:35,984 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2023-02-15 22:14:35,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2023-02-15 22:14:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:14:35,984 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:35,984 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] [2023-02-15 22:14:35,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 22:14:35,984 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2047381958, now seen corresponding path program 1 times [2023-02-15 22:14:35,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:35,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930369164] [2023-02-15 22:14:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:36,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:36,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930369164] [2023-02-15 22:14:36,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930369164] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:36,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265990376] [2023-02-15 22:14:36,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:36,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:36,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:36,063 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) [2023-02-15 22:14:36,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:14:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:36,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 22:14:36,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:36,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:14:36,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:14:36,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265990376] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:36,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:14:36,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-02-15 22:14:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129530600] [2023-02-15 22:14:36,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:36,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:14:36,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:36,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:14:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:14:36,212 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:36,237 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2023-02-15 22:14:36,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:14:36,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 22:14:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:36,238 INFO L225 Difference]: With dead ends: 169 [2023-02-15 22:14:36,239 INFO L226 Difference]: Without dead ends: 169 [2023-02-15 22:14:36,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:14:36,239 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 72 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:36,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 127 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:14:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-15 22:14:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2023-02-15 22:14:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 168 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2023-02-15 22:14:36,242 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 31 [2023-02-15 22:14:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:36,242 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 179 transitions. [2023-02-15 22:14:36,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2023-02-15 22:14:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 22:14:36,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:36,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:36,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:14:36,447 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,SelfDestructingSolverStorable19 [2023-02-15 22:14:36,447 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash 739766256, now seen corresponding path program 1 times [2023-02-15 22:14:36,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:36,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262569015] [2023-02-15 22:14:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:36,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:36,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262569015] [2023-02-15 22:14:36,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262569015] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:36,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:36,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:14:36,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455932911] [2023-02-15 22:14:36,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:36,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:14:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:36,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:14:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:14:36,617 INFO L87 Difference]: Start difference. First operand 169 states and 179 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:36,837 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2023-02-15 22:14:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:14:36,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 22:14:36,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:36,838 INFO L225 Difference]: With dead ends: 169 [2023-02-15 22:14:36,838 INFO L226 Difference]: Without dead ends: 169 [2023-02-15 22:14:36,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:14:36,839 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 59 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:36,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 374 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:14:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-15 22:14:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2023-02-15 22:14:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 167 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) [2023-02-15 22:14:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2023-02-15 22:14:36,841 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 32 [2023-02-15 22:14:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:36,841 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2023-02-15 22:14:36,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2023-02-15 22:14:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 22:14:36,842 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:36,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:36,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 22:14:36,842 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 739766257, now seen corresponding path program 1 times [2023-02-15 22:14:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:36,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886450641] [2023-02-15 22:14:36,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:37,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:37,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886450641] [2023-02-15 22:14:37,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886450641] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:37,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:37,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:14:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240044488] [2023-02-15 22:14:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:37,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:14:37,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:37,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:14:37,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:14:37,094 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:37,341 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2023-02-15 22:14:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:14:37,341 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 22:14:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:37,342 INFO L225 Difference]: With dead ends: 164 [2023-02-15 22:14:37,342 INFO L226 Difference]: Without dead ends: 164 [2023-02-15 22:14:37,342 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 [2023-02-15 22:14:37,343 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 72 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:37,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 377 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:14:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-15 22:14:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2023-02-15 22:14:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 151 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) [2023-02-15 22:14:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2023-02-15 22:14:37,345 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 32 [2023-02-15 22:14:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:37,345 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2023-02-15 22:14:37,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2023-02-15 22:14:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:14:37,345 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:37,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:37,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 22:14:37,345 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:37,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:37,346 INFO L85 PathProgramCache]: Analyzing trace with hash -439030339, now seen corresponding path program 1 times [2023-02-15 22:14:37,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:37,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71374957] [2023-02-15 22:14:37,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:37,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:14:37,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:37,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71374957] [2023-02-15 22:14:37,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71374957] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:37,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:37,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:14:37,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138561847] [2023-02-15 22:14:37,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:37,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:14:37,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:14:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:14:37,420 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:37,481 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2023-02-15 22:14:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:14:37,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 22:14:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:37,482 INFO L225 Difference]: With dead ends: 161 [2023-02-15 22:14:37,482 INFO L226 Difference]: Without dead ends: 161 [2023-02-15 22:14:37,483 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 [2023-02-15 22:14:37,483 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 7 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:37,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:14:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-15 22:14:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2023-02-15 22:14:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2023-02-15 22:14:37,485 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 33 [2023-02-15 22:14:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:37,485 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2023-02-15 22:14:37,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2023-02-15 22:14:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 22:14:37,486 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:37,486 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] [2023-02-15 22:14:37,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 22:14:37,486 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:37,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:37,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1958129913, now seen corresponding path program 1 times [2023-02-15 22:14:37,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:37,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878314281] [2023-02-15 22:14:37,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:37,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:37,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:37,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878314281] [2023-02-15 22:14:37,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878314281] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:37,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228120985] [2023-02-15 22:14:37,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:37,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:37,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:37,652 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) [2023-02-15 22:14:37,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:14:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:37,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 22:14:37,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:37,805 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:37,808 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:37,854 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:14:37,859 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:37,871 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:14:37,879 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:37,965 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:37,967 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:14:38,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:14:38,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228120985] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:14:38,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:14:38,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2023-02-15 22:14:38,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618603511] [2023-02-15 22:14:38,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:38,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:14:38,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:14:38,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:14:38,101 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:38,543 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2023-02-15 22:14:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:14:38,544 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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 34 [2023-02-15 22:14:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:38,545 INFO L225 Difference]: With dead ends: 210 [2023-02-15 22:14:38,545 INFO L226 Difference]: Without dead ends: 210 [2023-02-15 22:14:38,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2023-02-15 22:14:38,545 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 247 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:38,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 583 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:14:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-15 22:14:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 166. [2023-02-15 22:14:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 165 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2023-02-15 22:14:38,548 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 34 [2023-02-15 22:14:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:38,548 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2023-02-15 22:14:38,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2023-02-15 22:14:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 22:14:38,548 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:38,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:38,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:14:38,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:38,771 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash 572484842, now seen corresponding path program 1 times [2023-02-15 22:14:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:38,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694874401] [2023-02-15 22:14:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:14:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:38,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694874401] [2023-02-15 22:14:38,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694874401] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:38,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:38,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:14:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664503327] [2023-02-15 22:14:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:38,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:14:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:38,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:14:38,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:14:38,801 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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) [2023-02-15 22:14:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:38,823 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2023-02-15 22:14:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:14:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 22:14:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:38,824 INFO L225 Difference]: With dead ends: 165 [2023-02-15 22:14:38,824 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 22:14:38,824 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 [2023-02-15 22:14:38,825 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:38,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:14:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 22:14:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-02-15 22:14:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 164 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) [2023-02-15 22:14:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2023-02-15 22:14:38,827 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 35 [2023-02-15 22:14:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:38,828 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2023-02-15 22:14:38,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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) [2023-02-15 22:14:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2023-02-15 22:14:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:14:38,831 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:38,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:38,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 22:14:38,832 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash 402130029, now seen corresponding path program 1 times [2023-02-15 22:14:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:38,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96631858] [2023-02-15 22:14:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:14:39,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:39,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96631858] [2023-02-15 22:14:39,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96631858] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:39,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464504715] [2023-02-15 22:14:39,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:39,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:39,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:39,075 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) [2023-02-15 22:14:39,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:14:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:39,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 22:14:39,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:39,235 INFO L321 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-02-15 22:14:39,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 20 treesize of output 27 [2023-02-15 22:14:39,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 20 treesize of output 19 [2023-02-15 22:14:39,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2023-02-15 22:14:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:14:39,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:14:39,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464504715] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:14:39,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:14:39,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2023-02-15 22:14:39,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857010668] [2023-02-15 22:14:39,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:39,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:14:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:39,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:14:39,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:14:39,820 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:40,230 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2023-02-15 22:14:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:14:40,231 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 22:14:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:40,232 INFO L225 Difference]: With dead ends: 175 [2023-02-15 22:14:40,232 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 22:14:40,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:14:40,232 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 22 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:40,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 479 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:14:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 22:14:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-02-15 22:14:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 126 states have (on average 1.2619047619047619) internal successors, (159), 149 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) [2023-02-15 22:14:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2023-02-15 22:14:40,234 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 37 [2023-02-15 22:14:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:40,234 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2023-02-15 22:14:40,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2023-02-15 22:14:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:14:40,234 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:40,235 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] [2023-02-15 22:14:40,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 22:14:40,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 22:14:40,441 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:40,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:40,441 INFO L85 PathProgramCache]: Analyzing trace with hash -426569403, now seen corresponding path program 1 times [2023-02-15 22:14:40,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:40,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367174850] [2023-02-15 22:14:40,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:40,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:40,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:40,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367174850] [2023-02-15 22:14:40,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367174850] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:40,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554219837] [2023-02-15 22:14:40,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:40,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:40,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:40,982 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) [2023-02-15 22:14:41,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:14:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:41,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 22:14:41,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:41,136 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,153 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,196 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:14:41,197 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:41,225 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,235 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,291 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:14:41,291 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,296 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,311 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,342 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,362 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,412 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:41,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:41,459 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1541) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2023-02-15 22:14:41,543 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1541 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1539) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1538) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1541) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2023-02-15 22:14:41,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:41,604 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,607 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:41,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-02-15 22:14:42,816 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:14:42,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:42,820 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 31 [2023-02-15 22:14:42,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-02-15 22:14:42,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:14:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:42,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554219837] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:14:42,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:14:42,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 36 [2023-02-15 22:14:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259560544] [2023-02-15 22:14:42,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:42,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 22:14:42,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:42,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 22:14:42,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=931, Unknown=19, NotChecked=130, Total=1260 [2023-02-15 22:14:42,866 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 36 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) [2023-02-15 22:14:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:43,851 INFO L93 Difference]: Finished difference Result 363 states and 387 transitions. [2023-02-15 22:14:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:14:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 36 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 39 [2023-02-15 22:14:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:43,852 INFO L225 Difference]: With dead ends: 363 [2023-02-15 22:14:43,852 INFO L226 Difference]: Without dead ends: 363 [2023-02-15 22:14:43,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=443, Invalid=1802, Unknown=19, NotChecked=186, Total=2450 [2023-02-15 22:14:43,853 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 568 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 424 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:43,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 836 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1462 Invalid, 1 Unknown, 424 Unchecked, 0.7s Time] [2023-02-15 22:14:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-02-15 22:14:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 176. [2023-02-15 22:14:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 152 states have (on average 1.230263157894737) internal successors, (187), 175 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 187 transitions. [2023-02-15 22:14:43,856 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 187 transitions. Word has length 39 [2023-02-15 22:14:43,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:43,856 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 187 transitions. [2023-02-15 22:14:43,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 36 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) [2023-02-15 22:14:43,856 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 187 transitions. [2023-02-15 22:14:43,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:14:43,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:43,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:43,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 22:14:44,062 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,SelfDestructingSolverStorable26 [2023-02-15 22:14:44,062 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash 268919448, now seen corresponding path program 1 times [2023-02-15 22:14:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:44,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027248770] [2023-02-15 22:14:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:44,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027248770] [2023-02-15 22:14:44,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027248770] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:14:44,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:14:44,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 22:14:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49927122] [2023-02-15 22:14:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:14:44,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:14:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:44,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:14:44,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:14:44,376 INFO L87 Difference]: Start difference. First operand 176 states and 187 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:44,667 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2023-02-15 22:14:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:14:44,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-15 22:14:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:44,668 INFO L225 Difference]: With dead ends: 190 [2023-02-15 22:14:44,668 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 22:14:44,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:14:44,668 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 92 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:44,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 469 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:14:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 22:14:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 167. [2023-02-15 22:14:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 166 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) [2023-02-15 22:14:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 178 transitions. [2023-02-15 22:14:44,671 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 178 transitions. Word has length 41 [2023-02-15 22:14:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:44,671 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 178 transitions. [2023-02-15 22:14:44,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2023-02-15 22:14:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:14:44,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:44,671 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] [2023-02-15 22:14:44,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-15 22:14:44,672 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:44,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1035696014, now seen corresponding path program 1 times [2023-02-15 22:14:44,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:44,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768193477] [2023-02-15 22:14:44,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:44,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:45,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768193477] [2023-02-15 22:14:45,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768193477] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:45,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228006961] [2023-02-15 22:14:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:45,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:45,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:45,041 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) [2023-02-15 22:14:45,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:14:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:45,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 22:14:45,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:45,191 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:45,254 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:14:45,254 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:45,281 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:45,365 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:14:45,365 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:45,455 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:14:45,456 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:45,497 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:14:45,497 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:45,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 22:14:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:45,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:47,804 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_1772) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2023-02-15 22:14:47,808 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1772) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2023-02-15 22:14:47,826 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1770 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1770))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1772)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2023-02-15 22:14:47,840 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1770 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1770))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1772)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2023-02-15 22:14:47,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:47,848 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:47,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:47,856 INFO L350 Elim1Store]: Elim1 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 144 treesize of output 131 [2023-02-15 22:14:47,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:47,863 INFO L350 Elim1Store]: Elim1 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 116 treesize of output 114 [2023-02-15 22:14:47,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2023-02-15 22:14:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:52,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228006961] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:14:52,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:14:52,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 31 [2023-02-15 22:14:52,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136097333] [2023-02-15 22:14:52,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:52,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 22:14:52,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 22:14:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=612, Unknown=14, NotChecked=220, Total=992 [2023-02-15 22:14:52,427 INFO L87 Difference]: Start difference. First operand 167 states and 178 transitions. Second operand has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 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) [2023-02-15 22:14:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:55,321 INFO L93 Difference]: Finished difference Result 272 states and 290 transitions. [2023-02-15 22:14:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:14:55,322 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 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 46 [2023-02-15 22:14:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:55,323 INFO L225 Difference]: With dead ends: 272 [2023-02-15 22:14:55,323 INFO L226 Difference]: Without dead ends: 272 [2023-02-15 22:14:55,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=286, Invalid=1047, Unknown=15, NotChecked=292, Total=1640 [2023-02-15 22:14:55,323 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 572 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 765 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:55,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 577 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1092 Invalid, 0 Unknown, 765 Unchecked, 0.6s Time] [2023-02-15 22:14:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-02-15 22:14:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 175. [2023-02-15 22:14:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.236842105263158) internal successors, (188), 174 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:14:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2023-02-15 22:14:55,326 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 46 [2023-02-15 22:14:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:55,326 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2023-02-15 22:14:55,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 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) [2023-02-15 22:14:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2023-02-15 22:14:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:14:55,326 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:55,326 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] [2023-02-15 22:14:55,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 22:14:55,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 22:14:55,532 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:14:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1035696015, now seen corresponding path program 1 times [2023-02-15 22:14:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:55,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511188721] [2023-02-15 22:14:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:55,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:56,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:56,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511188721] [2023-02-15 22:14:56,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511188721] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:56,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390412564] [2023-02-15 22:14:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:56,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:56,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:56,082 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) [2023-02-15 22:14:56,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:14:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:56,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 22:14:56,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:56,249 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:56,302 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:14:56,303 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:56,329 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:56,385 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:14:56,385 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:56,454 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:14:56,454 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:56,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:56,460 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:56,509 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:14:56,509 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 43 [2023-02-15 22:14:56,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 22:14:56,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-02-15 22:14:56,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 22:14:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:56,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:56,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:56,885 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 47 [2023-02-15 22:14:56,925 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1911 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1911) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 1))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_1) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8))) (forall ((v_ArrVal_1912 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1912) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_~end~0#1.base|))) is different from false [2023-02-15 22:14:57,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:57,054 INFO L350 Elim1Store]: Elim1 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 104 treesize of output 95 [2023-02-15 22:14:57,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2023-02-15 22:14:57,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2023-02-15 22:14:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:57,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390412564] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:14:57,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:14:57,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2023-02-15 22:14:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514230776] [2023-02-15 22:14:57,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:57,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 22:14:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:57,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 22:14:57,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1140, Unknown=5, NotChecked=68, Total=1332 [2023-02-15 22:14:57,305 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:15:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:15:03,153 INFO L93 Difference]: Finished difference Result 247 states and 264 transitions. [2023-02-15 22:15:03,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:15:03,154 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-15 22:15:03,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:15:03,154 INFO L225 Difference]: With dead ends: 247 [2023-02-15 22:15:03,154 INFO L226 Difference]: Without dead ends: 247 [2023-02-15 22:15:03,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=424, Invalid=2544, Unknown=6, NotChecked=106, Total=3080 [2023-02-15 22:15:03,156 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 754 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:15:03,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1019 Invalid, 2051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1817 Invalid, 0 Unknown, 151 Unchecked, 0.9s Time] [2023-02-15 22:15:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-15 22:15:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2023-02-15 22:15:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.232258064516129) internal successors, (191), 177 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:15:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2023-02-15 22:15:03,158 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 46 [2023-02-15 22:15:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:15:03,159 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2023-02-15 22:15:03,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:15:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2023-02-15 22:15:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:15:03,159 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:15:03,159 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] [2023-02-15 22:15:03,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 22:15:03,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:15:03,365 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:15:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:15:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1558963792, now seen corresponding path program 1 times [2023-02-15 22:15:03,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:15:03,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279842103] [2023-02-15 22:15:03,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:15:03,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:15:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:15:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:15:04,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:15:04,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279842103] [2023-02-15 22:15:04,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279842103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:15:04,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266021119] [2023-02-15 22:15:04,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:15:04,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:15:04,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:15:04,343 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) [2023-02-15 22:15:04,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:15:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:15:04,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-15 22:15:04,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:15:04,541 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,559 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,612 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:15:04,613 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:04,642 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,649 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,737 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:15:04,737 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,740 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,759 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,795 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,830 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,864 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 22:15:04,864 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,900 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,905 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,992 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:15:04,992 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:04,999 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:05,019 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:05,071 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:05,103 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:05,159 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:15:05,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:15:05,223 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2114 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2114) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2023-02-15 22:15:05,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:05,405 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:05,408 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:05,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-02-15 22:15:05,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:05,912 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:05,927 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:05,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-02-15 22:15:05,988 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-02-15 22:15:05,988 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:06,116 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse0 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int) (v_ArrVal_2102 Int) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2110 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2102)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2110) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2114) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) ~unnamed1~0~BLACK) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_#t~malloc4#1.base|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_arrayElimCell_75 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_arrayElimCell_75) (forall ((v_ArrVal_2102 Int) (v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2110 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2102)))) (or (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2110) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2114) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) ~unnamed1~0~BLACK) (= (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2104) v_arrayElimCell_75 v_ArrVal_2110) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2114) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) ~unnamed1~0~BLACK)))))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_#t~malloc4#1.base|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|))) (or .cse0 (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_ArrVal_2102 Int) (v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2110 (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2102)))) (or (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2110) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2114) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) ~unnamed1~0~BLACK) (= (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2104) v_arrayElimCell_75 v_ArrVal_2110) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2114) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) ~unnamed1~0~BLACK)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_#t~malloc4#1.base|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_ArrVal_2102 Int) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2110 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2102)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2110) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2114) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) ~unnamed1~0~BLACK)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_#t~malloc4#1.base|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int) (v_ArrVal_2102 Int) (v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2110 (Array Int Int)) (v_arrayElimCell_75 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_arrayElimCell_75) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2102)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2104) v_arrayElimCell_75 v_ArrVal_2110) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2114) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) ~unnamed1~0~BLACK))) (not .cse0)))) is different from false [2023-02-15 22:15:17,003 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:17,007 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:17,007 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 34 [2023-02-15 22:15:17,010 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:17,012 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 24 [2023-02-15 22:15:17,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:15:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:15:17,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266021119] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:15:17,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:15:17,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 22] total 57 [2023-02-15 22:15:17,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520010319] [2023-02-15 22:15:17,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:15:17,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-02-15 22:15:17,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:15:17,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-02-15 22:15:17,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2537, Unknown=53, NotChecked=214, Total=3192 [2023-02-15 22:15:17,053 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand has 57 states, 57 states have (on average 2.3684210526315788) internal successors, (135), 57 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:15:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:15:19,619 INFO L93 Difference]: Finished difference Result 278 states and 299 transitions. [2023-02-15 22:15:19,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 22:15:19,620 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.3684210526315788) internal successors, (135), 57 states have internal predecessors, (135), 0 states have call successors, (0), 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 49 [2023-02-15 22:15:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:15:19,620 INFO L225 Difference]: With dead ends: 278 [2023-02-15 22:15:19,620 INFO L226 Difference]: Without dead ends: 278 [2023-02-15 22:15:19,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=866, Invalid=4639, Unknown=53, NotChecked=294, Total=5852 [2023-02-15 22:15:19,622 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 568 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 2806 mSolverCounterSat, 75 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2806 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 380 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:15:19,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1167 Invalid, 3262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2806 Invalid, 1 Unknown, 380 Unchecked, 1.4s Time] [2023-02-15 22:15:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-02-15 22:15:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 204. [2023-02-15 22:15:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.2044198895027625) internal successors, (218), 203 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:15:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 218 transitions. [2023-02-15 22:15:19,624 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 218 transitions. Word has length 49 [2023-02-15 22:15:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:15:19,625 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 218 transitions. [2023-02-15 22:15:19,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.3684210526315788) internal successors, (135), 57 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:15:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 218 transitions. [2023-02-15 22:15:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:15:19,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:15:19,625 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, 1, 1, 1, 1] [2023-02-15 22:15:19,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:15:19,825 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,SelfDestructingSolverStorable30 [2023-02-15 22:15:19,826 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 22:15:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:15:19,826 INFO L85 PathProgramCache]: Analyzing trace with hash 775361098, now seen corresponding path program 2 times [2023-02-15 22:15:19,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:15:19,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218408015] [2023-02-15 22:15:19,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:15:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:15:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:15:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:15:20,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:15:20,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218408015] [2023-02-15 22:15:20,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218408015] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:15:20,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656637386] [2023-02-15 22:15:20,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:15:20,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:15:20,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:15:20,601 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) [2023-02-15 22:15:20,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:15:20,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:15:20,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:15:20,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 22:15:20,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:15:20,816 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:20,881 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:15:20,881 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:20,907 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:20,910 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:20,977 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:15:20,977 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:20,981 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 9 [2023-02-15 22:15:21,056 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:15:21,056 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:21,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-02-15 22:15:21,070 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:15:21,070 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:21,113 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:15:21,113 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:21,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:21,123 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:15:21,471 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 22:15:21,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2023-02-15 22:15:21,476 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-15 22:15:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:15:21,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:15:21,737 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2256 (Array Int Int))) (or (forall ((v_ArrVal_2257 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2257))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2256) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select v_ArrVal_2257 |c_ULTIMATE.start_main_~end~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2256 |c_ULTIMATE.start_main_~end~0#1.offset|))))) (forall ((v_ArrVal_2256 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2256 |c_ULTIMATE.start_main_~end~0#1.offset|))) (forall ((v_ArrVal_2257 (Array Int Int))) (= (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2256))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2257) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) |c_ULTIMATE.start_main_~null~0#1.offset|))))) is different from false [2023-02-15 22:15:21,774 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2256 (Array Int Int))) (or (forall ((v_ArrVal_2257 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2257))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2256) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select v_ArrVal_2257 |c_ULTIMATE.start_main_#t~mem6#1.offset|))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2256 |c_ULTIMATE.start_main_#t~mem6#1.offset|))))) (forall ((v_ArrVal_2256 (Array Int Int))) (or (forall ((v_ArrVal_2257 (Array Int Int))) (= (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2256))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2257) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) |c_ULTIMATE.start_main_~null~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2256 |c_ULTIMATE.start_main_#t~mem6#1.offset|)))))) is different from false [2023-02-15 22:15:21,787 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_2256 (Array Int Int))) (or (forall ((v_ArrVal_2257 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2256))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2257) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) |c_ULTIMATE.start_main_~null~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2256 .cse2))))) (forall ((v_ArrVal_2256 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2256 .cse2))) (forall ((v_ArrVal_2257 (Array Int Int))) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2257))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2256) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select v_ArrVal_2257 .cse2))))))) is different from false [2023-02-15 22:15:21,821 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2253))) (or (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2256 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_ArrVal_2257 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2252))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (store .cse0 .cse3 v_ArrVal_2256))) (select (select .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2257) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) |c_ULTIMATE.start_main_~null~0#1.offset|))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2253))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2256 .cse4))) (forall ((v_ArrVal_2257 (Array Int Int))) (= (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2252))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse5 (store .cse6 .cse7 v_ArrVal_2257))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store .cse8 .cse7 v_ArrVal_2256) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (select v_ArrVal_2257 .cse4)))))))) is different from false [2023-02-15 22:15:21,836 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2253))) (or (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2256 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_ArrVal_2257 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2252))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (store .cse0 .cse3 v_ArrVal_2256))) (select (select .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2257) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) |c_ULTIMATE.start_main_~null~0#1.offset|))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2253))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_2257 (Array Int Int))) (= (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2252))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse5 (store .cse6 .cse7 v_ArrVal_2257))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store .cse8 .cse7 v_ArrVal_2256) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (select v_ArrVal_2257 .cse9))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2256 .cse9))))))))) is different from false [2023-02-15 22:15:21,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:21,856 INFO L350 Elim1Store]: Elim1 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 124 treesize of output 108 [2023-02-15 22:15:21,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:21,861 INFO L350 Elim1Store]: Elim1 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 86 treesize of output 63 [2023-02-15 22:15:21,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:21,871 INFO L350 Elim1Store]: Elim1 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 698 treesize of output 601 [2023-02-15 22:15:22,413 INFO L321 Elim1Store]: treesize reduction 294, result has 60.5 percent of original size [2023-02-15 22:15:22,413 INFO L350 Elim1Store]: Elim1 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 12326 treesize of output 11199 [2023-02-15 22:15:22,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:22,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 10391 treesize of output 9881 [2023-02-15 22:15:22,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10294 treesize of output 9342 [2023-02-15 22:15:22,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:22,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 9422 treesize of output 8694 [2023-02-15 22:15:23,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:23,162 INFO L350 Elim1Store]: Elim1 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 8540 treesize of output 7184