./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.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/sll-buckets-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:17:04,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:17:04,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:17:04,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:17:04,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:17:04,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:17:04,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:17:04,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:17:04,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:17:04,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:17:04,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:17:04,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:17:04,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:17:04,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:17:04,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:17:04,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:17:04,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:17:04,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:17:04,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:17:04,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:17:04,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:17:04,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:17:04,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:17:04,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:17:04,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:17:04,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:17:04,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:17:04,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:17:04,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:17:04,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:17:04,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:17:04,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:17:04,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:17:04,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:17:04,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:17:04,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:17:04,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:17:04,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:17:04,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:17:04,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:17:04,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:17:04,909 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:17:04,949 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:17:04,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:17:04,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:17:04,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:17:04,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:17:04,951 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:17:04,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:17:04,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:17:04,952 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:17:04,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:17:04,953 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:17:04,968 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:17:04,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:17:04,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:17:04,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:17:04,969 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:17:04,969 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:17:04,969 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:17:04,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:17:04,970 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:17:04,970 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:17:04,970 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:17:04,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:17:04,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:17:04,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:17:04,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:17:04,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:17:04,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:17:04,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:17:04,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:17:04,971 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:17:04,971 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:17:04,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:17:04,972 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:17:04,972 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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2023-02-15 22:17:05,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:17:05,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:17:05,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:17:05,200 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:17:05,201 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:17:05,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2023-02-15 22:17:06,295 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:17:06,496 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:17:06,497 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2023-02-15 22:17:06,505 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7ad4a17/9c9af00ccfb147d7962e3a1c4f543a2d/FLAG1d44d847f [2023-02-15 22:17:06,898 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7ad4a17/9c9af00ccfb147d7962e3a1c4f543a2d [2023-02-15 22:17:06,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:17:06,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:17:06,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:17:06,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:17:06,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:17:06,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:17:06" (1/1) ... [2023-02-15 22:17:06,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b538aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:06, skipping insertion in model container [2023-02-15 22:17:06,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:17:06" (1/1) ... [2023-02-15 22:17:06,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:17:06,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:17:07,134 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/sll-buckets-1.i[22663,22676] [2023-02-15 22:17:07,139 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/sll-buckets-1.i[22734,22747] [2023-02-15 22:17:07,141 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/sll-buckets-1.i[22862,22875] [2023-02-15 22:17:07,148 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/sll-buckets-1.i[23275,23288] [2023-02-15 22:17:07,149 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/sll-buckets-1.i[23364,23377] [2023-02-15 22:17:07,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:17:07,163 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:17:07,221 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/sll-buckets-1.i[22663,22676] [2023-02-15 22:17:07,222 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/sll-buckets-1.i[22734,22747] [2023-02-15 22:17:07,223 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/sll-buckets-1.i[22862,22875] [2023-02-15 22:17:07,225 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/sll-buckets-1.i[23275,23288] [2023-02-15 22:17:07,225 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/sll-buckets-1.i[23364,23377] [2023-02-15 22:17:07,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:17:07,244 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:17:07,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07 WrapperNode [2023-02-15 22:17:07,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:17:07,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:17:07,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:17:07,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:17:07,251 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:17:07" (1/1) ... [2023-02-15 22:17:07,266 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:17:07" (1/1) ... [2023-02-15 22:17:07,283 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2023-02-15 22:17:07,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:17:07,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:17:07,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:17:07,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:17:07,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07" (1/1) ... [2023-02-15 22:17:07,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07" (1/1) ... [2023-02-15 22:17:07,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07" (1/1) ... [2023-02-15 22:17:07,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07" (1/1) ... [2023-02-15 22:17:07,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07" (1/1) ... [2023-02-15 22:17:07,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07" (1/1) ... [2023-02-15 22:17:07,308 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07" (1/1) ... [2023-02-15 22:17:07,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07" (1/1) ... [2023-02-15 22:17:07,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:17:07,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:17:07,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:17:07,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:17:07,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07" (1/1) ... [2023-02-15 22:17:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:17:07,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:17:07,348 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:17:07,353 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:17:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:17:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:17:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:17:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:17:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:17:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:17:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:17:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:17:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:17:07,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:17:07,581 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:17:07,582 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:17:07,873 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:17:07,880 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:17:07,880 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2023-02-15 22:17:07,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:17:07 BoogieIcfgContainer [2023-02-15 22:17:07,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:17:07,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:17:07,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:17:07,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:17:07,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:17:06" (1/3) ... [2023-02-15 22:17:07,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70da0925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:17:07, skipping insertion in model container [2023-02-15 22:17:07,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:07" (2/3) ... [2023-02-15 22:17:07,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70da0925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:17:07, skipping insertion in model container [2023-02-15 22:17:07,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:17:07" (3/3) ... [2023-02-15 22:17:07,889 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2023-02-15 22:17:07,905 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:17:07,907 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2023-02-15 22:17:07,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:17:07,945 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;@4b24f146, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:17:07,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-02-15 22:17:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:17:07,963 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:07,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:17:07,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:07,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:07,971 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 22:17:07,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:07,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204452993] [2023-02-15 22:17:07,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:07,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:08,150 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:17:08,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:08,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204452993] [2023-02-15 22:17:08,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204452993] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:08,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:08,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:17:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364637666] [2023-02-15 22:17:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:08,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:17:08,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:08,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:17:08,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:17:08,184 INFO L87 Difference]: Start difference. First operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:08,307 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2023-02-15 22:17:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:17:08,309 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:17:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:08,316 INFO L225 Difference]: With dead ends: 190 [2023-02-15 22:17:08,316 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 22:17:08,317 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:17:08,320 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:08,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 120 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 22:17:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 149. [2023-02-15 22:17:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 81 states have (on average 1.9259259259259258) internal successors, (156), 148 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2023-02-15 22:17:08,347 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2023-02-15 22:17:08,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:08,347 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2023-02-15 22:17:08,347 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:17:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2023-02-15 22:17:08,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:17:08,348 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:08,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:17:08,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:17:08,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:08,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 22:17:08,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:08,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554318308] [2023-02-15 22:17:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:08,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:08,406 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:17:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:08,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554318308] [2023-02-15 22:17:08,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554318308] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:08,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:08,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:17:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436619389] [2023-02-15 22:17:08,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:08,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:17:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:17:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:17:08,409 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:08,530 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2023-02-15 22:17:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:17:08,531 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:17:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:08,532 INFO L225 Difference]: With dead ends: 185 [2023-02-15 22:17:08,532 INFO L226 Difference]: Without dead ends: 185 [2023-02-15 22:17:08,532 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:17:08,533 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:08,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 190 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-15 22:17:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2023-02-15 22:17:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 81 states have (on average 1.876543209876543) internal successors, (152), 144 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2023-02-15 22:17:08,541 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 3 [2023-02-15 22:17:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:08,541 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2023-02-15 22:17:08,542 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:17:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2023-02-15 22:17:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:17:08,542 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:08,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:08,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:17:08,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:08,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924362, now seen corresponding path program 1 times [2023-02-15 22:17:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:08,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32911614] [2023-02-15 22:17:08,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:08,683 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:17:08,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:08,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32911614] [2023-02-15 22:17:08,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32911614] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:08,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:08,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:17:08,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866170913] [2023-02-15 22:17:08,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:08,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:17:08,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:08,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:17:08,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:17:08,686 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:08,876 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2023-02-15 22:17:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:17:08,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 22:17:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:08,877 INFO L225 Difference]: With dead ends: 151 [2023-02-15 22:17:08,877 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 22:17:08,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:17:08,879 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 99 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:08,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 305 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:17:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 22:17:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2023-02-15 22:17:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 142 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2023-02-15 22:17:08,885 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 10 [2023-02-15 22:17:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:08,885 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2023-02-15 22:17:08,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2023-02-15 22:17:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:17:08,886 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:08,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:08,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:17:08,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924363, now seen corresponding path program 1 times [2023-02-15 22:17:08,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:08,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023831578] [2023-02-15 22:17:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:08,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:09,071 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:17:09,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:09,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023831578] [2023-02-15 22:17:09,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023831578] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:09,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:09,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:17:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481952834] [2023-02-15 22:17:09,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:09,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:17:09,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:09,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:17:09,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:17:09,077 INFO L87 Difference]: Start difference. First operand 143 states and 158 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:09,255 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2023-02-15 22:17:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:17:09,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 22:17:09,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:09,257 INFO L225 Difference]: With dead ends: 139 [2023-02-15 22:17:09,257 INFO L226 Difference]: Without dead ends: 139 [2023-02-15 22:17:09,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:17:09,263 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 8 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:09,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 416 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-15 22:17:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-02-15 22:17:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.711111111111111) internal successors, (154), 138 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2023-02-15 22:17:09,277 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 10 [2023-02-15 22:17:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:09,278 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2023-02-15 22:17:09,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2023-02-15 22:17:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:17:09,278 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:09,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:09,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:17:09,279 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:09,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash 592229104, now seen corresponding path program 1 times [2023-02-15 22:17:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:09,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341805301] [2023-02-15 22:17:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:09,433 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:17:09,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:09,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341805301] [2023-02-15 22:17:09,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341805301] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:09,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:09,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:17:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644546246] [2023-02-15 22:17:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:09,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:17:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:17:09,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:17:09,436 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:09,603 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2023-02-15 22:17:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:17:09,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 22:17:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:09,607 INFO L225 Difference]: With dead ends: 146 [2023-02-15 22:17:09,607 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 22:17:09,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:17:09,611 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 94 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:09,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 297 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:09,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 22:17:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2023-02-15 22:17:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.7) internal successors, (153), 137 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2023-02-15 22:17:09,622 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 17 [2023-02-15 22:17:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:09,622 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2023-02-15 22:17:09,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2023-02-15 22:17:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:17:09,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:09,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:09,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:17:09,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:09,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash 592229105, now seen corresponding path program 1 times [2023-02-15 22:17:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:09,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057446298] [2023-02-15 22:17:09,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:09,804 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:17:09,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:09,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057446298] [2023-02-15 22:17:09,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057446298] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:09,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:09,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:17:09,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97253068] [2023-02-15 22:17:09,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:09,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:17:09,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:09,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:17:09,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:17:09,806 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:09,945 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2023-02-15 22:17:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:17:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 22:17:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:09,946 INFO L225 Difference]: With dead ends: 138 [2023-02-15 22:17:09,946 INFO L226 Difference]: Without dead ends: 138 [2023-02-15 22:17:09,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:17:09,948 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 8 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:09,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-15 22:17:09,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2023-02-15 22:17:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.6666666666666667) internal successors, (150), 134 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2023-02-15 22:17:09,953 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 17 [2023-02-15 22:17:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:09,953 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2023-02-15 22:17:09,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2023-02-15 22:17:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 22:17:09,954 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:09,955 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] [2023-02-15 22:17:09,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:17:09,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:09,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:09,957 INFO L85 PathProgramCache]: Analyzing trace with hash 840457529, now seen corresponding path program 1 times [2023-02-15 22:17:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:09,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539992786] [2023-02-15 22:17:09,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:09,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:10,019 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:17:10,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:10,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539992786] [2023-02-15 22:17:10,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539992786] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:10,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:10,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:17:10,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411638142] [2023-02-15 22:17:10,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:10,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:17:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:10,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:17:10,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:17:10,022 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:10,075 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2023-02-15 22:17:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:17:10,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 22:17:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:10,076 INFO L225 Difference]: With dead ends: 141 [2023-02-15 22:17:10,077 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 22:17:10,077 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:17:10,077 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 67 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:10,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:17:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 22:17:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2023-02-15 22:17:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.6111111111111112) internal successors, (145), 129 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2023-02-15 22:17:10,081 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 23 [2023-02-15 22:17:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:10,081 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2023-02-15 22:17:10,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2023-02-15 22:17:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 22:17:10,082 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:10,082 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] [2023-02-15 22:17:10,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:17:10,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:10,083 INFO L85 PathProgramCache]: Analyzing trace with hash 840457530, now seen corresponding path program 1 times [2023-02-15 22:17:10,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:10,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682326152] [2023-02-15 22:17:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:10,190 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:17:10,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:10,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682326152] [2023-02-15 22:17:10,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682326152] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:10,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:10,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:17:10,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799268388] [2023-02-15 22:17:10,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:10,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:17:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:10,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:17:10,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:17:10,192 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:10,246 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2023-02-15 22:17:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:17:10,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 22:17:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:10,247 INFO L225 Difference]: With dead ends: 136 [2023-02-15 22:17:10,247 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 22:17:10,247 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:17:10,248 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 62 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:10,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 144 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 22:17:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2023-02-15 22:17:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 124 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2023-02-15 22:17:10,250 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 23 [2023-02-15 22:17:10,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:10,250 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2023-02-15 22:17:10,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2023-02-15 22:17:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:17:10,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:10,251 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:17:10,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:17:10,252 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash 225913191, now seen corresponding path program 1 times [2023-02-15 22:17:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:10,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343842198] [2023-02-15 22:17:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:10,391 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:17:10,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:10,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343842198] [2023-02-15 22:17:10,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343842198] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:10,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:10,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:17:10,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25879924] [2023-02-15 22:17:10,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:10,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:17:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:10,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:17:10,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:17:10,393 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:10,482 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2023-02-15 22:17:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:17:10,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 22:17:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:10,484 INFO L225 Difference]: With dead ends: 175 [2023-02-15 22:17:10,484 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 22:17:10,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:17:10,486 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 217 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:10,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 109 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 22:17:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2023-02-15 22:17:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.5670103092783505) internal successors, (152), 131 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2023-02-15 22:17:10,489 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 25 [2023-02-15 22:17:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:10,490 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2023-02-15 22:17:10,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2023-02-15 22:17:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:17:10,491 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:10,491 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:17:10,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:17:10,492 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash 225913192, now seen corresponding path program 1 times [2023-02-15 22:17:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:10,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679711133] [2023-02-15 22:17:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:10,698 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:17:10,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:10,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679711133] [2023-02-15 22:17:10,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679711133] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:10,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:10,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:17:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728948062] [2023-02-15 22:17:10,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:10,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:17:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:10,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:17:10,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:17:10,701 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:10,808 INFO L93 Difference]: Finished difference Result 188 states and 217 transitions. [2023-02-15 22:17:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:17:10,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 22:17:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:10,810 INFO L225 Difference]: With dead ends: 188 [2023-02-15 22:17:10,810 INFO L226 Difference]: Without dead ends: 188 [2023-02-15 22:17:10,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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:17:10,811 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 74 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:10,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 202 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-15 22:17:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2023-02-15 22:17:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 165 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 206 transitions. [2023-02-15 22:17:10,815 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 206 transitions. Word has length 25 [2023-02-15 22:17:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:10,815 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 206 transitions. [2023-02-15 22:17:10,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 206 transitions. [2023-02-15 22:17:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:17:10,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:10,816 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:17:10,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:17:10,816 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:10,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1586624732, now seen corresponding path program 1 times [2023-02-15 22:17:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:10,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804032368] [2023-02-15 22:17:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:10,867 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:17:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:10,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804032368] [2023-02-15 22:17:10,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804032368] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:10,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:10,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:17:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875912825] [2023-02-15 22:17:10,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:10,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:17:10,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:10,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:17:10,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:17:10,869 INFO L87 Difference]: Start difference. First operand 166 states and 206 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:17:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:10,941 INFO L93 Difference]: Finished difference Result 254 states and 308 transitions. [2023-02-15 22:17:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:17:10,941 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:17:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:10,943 INFO L225 Difference]: With dead ends: 254 [2023-02-15 22:17:10,944 INFO L226 Difference]: Without dead ends: 254 [2023-02-15 22:17:10,944 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:17:10,945 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 208 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:10,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 214 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-15 22:17:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 167. [2023-02-15 22:17:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 166 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2023-02-15 22:17:10,951 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 26 [2023-02-15 22:17:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:10,951 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2023-02-15 22:17:10,951 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:17:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2023-02-15 22:17:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:17:10,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:10,957 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:17:10,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:17:10,957 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:10,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1044883735, now seen corresponding path program 1 times [2023-02-15 22:17:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:10,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343277330] [2023-02-15 22:17:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:10,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:11,579 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:17:11,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:11,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343277330] [2023-02-15 22:17:11,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343277330] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:11,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:11,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-15 22:17:11,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865348876] [2023-02-15 22:17:11,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:11,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 22:17:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:11,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 22:17:11,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:17:11,582 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:12,278 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2023-02-15 22:17:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 22:17:12,280 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 22:17:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:12,280 INFO L225 Difference]: With dead ends: 179 [2023-02-15 22:17:12,281 INFO L226 Difference]: Without dead ends: 179 [2023-02-15 22:17:12,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 22:17:12,281 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 222 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:12,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 710 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:17:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-15 22:17:12,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 145. [2023-02-15 22:17:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 144 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2023-02-15 22:17:12,284 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 29 [2023-02-15 22:17:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:12,284 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2023-02-15 22:17:12,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2023-02-15 22:17:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:17:12,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:12,285 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:17:12,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:17:12,285 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:12,285 INFO L85 PathProgramCache]: Analyzing trace with hash 981328753, now seen corresponding path program 1 times [2023-02-15 22:17:12,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:12,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699571669] [2023-02-15 22:17:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:12,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:12,329 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:17:12,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:12,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699571669] [2023-02-15 22:17:12,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699571669] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:12,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:12,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:17:12,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794033637] [2023-02-15 22:17:12,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:12,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:17:12,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:12,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:17:12,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:17:12,332 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:12,348 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2023-02-15 22:17:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:17:12,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 22:17:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:12,349 INFO L225 Difference]: With dead ends: 145 [2023-02-15 22:17:12,349 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 22:17:12,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:17:12,350 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:12,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 175 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:17:12,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 22:17:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2023-02-15 22:17:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 111 states have (on average 1.4684684684684686) internal successors, (163), 142 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2023-02-15 22:17:12,354 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 31 [2023-02-15 22:17:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:12,354 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2023-02-15 22:17:12,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2023-02-15 22:17:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 22:17:12,356 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:12,357 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:17:12,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 22:17:12,357 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash 356424450, now seen corresponding path program 1 times [2023-02-15 22:17:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:12,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394093819] [2023-02-15 22:17:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:12,618 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:17:12,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:12,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394093819] [2023-02-15 22:17:12,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394093819] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:12,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:12,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:17:12,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610444729] [2023-02-15 22:17:12,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:12,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:17:12,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:17:12,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:17:12,620 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 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:17:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:12,831 INFO L93 Difference]: Finished difference Result 225 states and 249 transitions. [2023-02-15 22:17:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:17:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 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:17:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:12,832 INFO L225 Difference]: With dead ends: 225 [2023-02-15 22:17:12,832 INFO L226 Difference]: Without dead ends: 225 [2023-02-15 22:17:12,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:17:12,833 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 388 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:12,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 219 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:17:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-15 22:17:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2023-02-15 22:17:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 171 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2023-02-15 22:17:12,836 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 32 [2023-02-15 22:17:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:12,836 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2023-02-15 22:17:12,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 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:17:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2023-02-15 22:17:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 22:17:12,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:12,836 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:17:12,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 22:17:12,836 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:12,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash 873646240, now seen corresponding path program 1 times [2023-02-15 22:17:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:12,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584438188] [2023-02-15 22:17:12,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:12,921 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:17:12,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:12,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584438188] [2023-02-15 22:17:12,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584438188] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:12,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:12,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:17:12,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425806591] [2023-02-15 22:17:12,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:12,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:17:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:12,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:17:12,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:17:12,923 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:13,014 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2023-02-15 22:17:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:17:13,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 22:17:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:13,015 INFO L225 Difference]: With dead ends: 209 [2023-02-15 22:17:13,016 INFO L226 Difference]: Without dead ends: 209 [2023-02-15 22:17:13,016 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:17:13,016 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 170 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:13,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 216 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-15 22:17:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2023-02-15 22:17:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 142 states have (on average 1.471830985915493) internal successors, (209), 173 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2023-02-15 22:17:13,019 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 35 [2023-02-15 22:17:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:13,019 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2023-02-15 22:17:13,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2023-02-15 22:17:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:17:13,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:13,020 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:17:13,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 22:17:13,021 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:13,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash 124937643, now seen corresponding path program 1 times [2023-02-15 22:17:13,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:13,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403703772] [2023-02-15 22:17:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:13,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:13,589 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:17:13,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:13,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403703772] [2023-02-15 22:17:13,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403703772] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:17:13,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337698656] [2023-02-15 22:17:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:13,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:17:13,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:17:13,612 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:17:13,617 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:17:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:13,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 22:17:13,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:17:13,784 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:17:13,806 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:17:13,806 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:17:13,821 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:17:13,865 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:17:13,877 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:17:13,899 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:17:13,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:17:13,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 22:17:14,138 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 22:17:14,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2023-02-15 22:17:14,149 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 12 treesize of output 8 [2023-02-15 22:17:14,220 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 22:17:14,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2023-02-15 22:17:14,295 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 22:17:14,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2023-02-15 22:17:14,315 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 16 treesize of output 12 [2023-02-15 22:17:14,382 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-15 22:17:14,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-02-15 22:17:14,429 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 32 treesize of output 30 [2023-02-15 22:17:14,485 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 32 treesize of output 30 [2023-02-15 22:17:14,662 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:17:14,663 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-15 22:17:14,726 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:17:14,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:17:17,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:17:17,404 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-02-15 22:17:26,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:17:26,083 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 36 treesize of output 37 [2023-02-15 22:17:26,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:17:26,089 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:17:26,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:17:26,097 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 50 treesize of output 50 [2023-02-15 22:17:26,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:17:26,107 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 68 treesize of output 64 [2023-02-15 22:17:26,250 INFO L321 Elim1Store]: treesize reduction 27, result has 77.7 percent of original size [2023-02-15 22:17:26,251 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 215 [2023-02-15 22:17:28,659 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:17:28,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337698656] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:17:28,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:17:28,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 44 [2023-02-15 22:17:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616725511] [2023-02-15 22:17:28,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:17:28,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 22:17:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:28,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 22:17:28,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1718, Unknown=27, NotChecked=0, Total=1980 [2023-02-15 22:17:28,661 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 45 states, 44 states have (on average 2.25) internal successors, (99), 45 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:33,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:17:39,220 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 66 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:17:45,845 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 81 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:17:54,712 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 61 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:17:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:55,217 INFO L93 Difference]: Finished difference Result 221 states and 250 transitions. [2023-02-15 22:17:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 22:17:55,218 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.25) internal successors, (99), 45 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 22:17:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:55,218 INFO L225 Difference]: With dead ends: 221 [2023-02-15 22:17:55,219 INFO L226 Difference]: Without dead ends: 221 [2023-02-15 22:17:55,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=719, Invalid=3810, Unknown=27, NotChecked=0, Total=4556 [2023-02-15 22:17:55,220 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 798 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 112 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:55,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1264 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1744 Invalid, 22 Unknown, 0 Unchecked, 4.3s Time] [2023-02-15 22:17:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-02-15 22:17:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 176. [2023-02-15 22:17:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.4722222222222223) internal successors, (212), 175 states have internal predecessors, (212), 0 states have call successors, (0), 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:17:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2023-02-15 22:17:55,223 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 37 [2023-02-15 22:17:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:55,223 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2023-02-15 22:17:55,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.25) internal successors, (99), 45 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2023-02-15 22:17:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:17:55,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:55,224 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:17:55,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:17:55,429 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,SelfDestructingSolverStorable15 [2023-02-15 22:17:55,430 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:55,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:55,430 INFO L85 PathProgramCache]: Analyzing trace with hash 124937644, now seen corresponding path program 1 times [2023-02-15 22:17:55,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:55,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042344560] [2023-02-15 22:17:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:55,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:56,368 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:17:56,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042344560] [2023-02-15 22:17:56,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042344560] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:17:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892432108] [2023-02-15 22:17:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:56,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:17:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:17:56,370 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:17:56,372 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:17:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:56,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 22:17:56,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:17:56,505 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:17:56,513 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:17:56,545 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 23 treesize of output 22 [2023-02-15 22:17:56,559 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:17:56,560 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:17:56,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:17:56,592 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:17:56,598 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:17:56,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 16 treesize of output 8 [2023-02-15 22:17:56,706 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:17:56,720 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:17:56,741 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:17:56,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:17:56,785 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:17:56,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:17:56,841 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 16 treesize of output 8 [2023-02-15 22:17:56,909 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:17:56,920 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:17:56,928 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:17:56,952 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:17:56,953 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:17:56,985 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:17:57,004 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 23 treesize of output 22 [2023-02-15 22:17:57,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:17:57,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2023-02-15 22:17:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:57,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:17:57,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892432108] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:57,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:17:57,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [17] total 32 [2023-02-15 22:17:57,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135782347] [2023-02-15 22:17:57,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:57,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 22:17:57,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:57,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 22:17:57,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2023-02-15 22:17:57,212 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:58,513 INFO L93 Difference]: Finished difference Result 288 states and 333 transitions. [2023-02-15 22:17:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:17:58,514 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 22:17:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:58,514 INFO L225 Difference]: With dead ends: 288 [2023-02-15 22:17:58,515 INFO L226 Difference]: Without dead ends: 287 [2023-02-15 22:17:58,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=271, Invalid=1985, Unknown=0, NotChecked=0, Total=2256 [2023-02-15 22:17:58,516 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 318 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:58,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 850 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:17:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-15 22:17:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 195. [2023-02-15 22:17:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 163 states have (on average 1.4355828220858895) internal successors, (234), 194 states have internal predecessors, (234), 0 states have call successors, (0), 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:17:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 234 transitions. [2023-02-15 22:17:58,519 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 234 transitions. Word has length 37 [2023-02-15 22:17:58,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:58,519 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 234 transitions. [2023-02-15 22:17:58,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 234 transitions. [2023-02-15 22:17:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:17:58,520 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:58,520 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] [2023-02-15 22:17:58,528 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:17:58,727 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,SelfDestructingSolverStorable16 [2023-02-15 22:17:58,727 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:17:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:58,727 INFO L85 PathProgramCache]: Analyzing trace with hash -706370693, now seen corresponding path program 1 times [2023-02-15 22:17:58,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:58,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528491407] [2023-02-15 22:17:58,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:58,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:59,281 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:17:59,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:59,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528491407] [2023-02-15 22:17:59,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528491407] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:17:59,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829711024] [2023-02-15 22:17:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:59,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:17:59,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:17:59,291 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:17:59,294 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:17:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:59,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 22:17:59,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:17:59,429 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:17:59,446 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:17:59,447 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:17:59,458 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:17:59,502 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:17:59,513 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:17:59,535 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:17:59,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:17:59,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 22:17:59,682 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 22:17:59,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2023-02-15 22:17:59,689 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 12 treesize of output 8 [2023-02-15 22:17:59,738 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 22:17:59,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2023-02-15 22:17:59,770 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 22:17:59,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2023-02-15 22:17:59,781 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 16 treesize of output 12 [2023-02-15 22:17:59,831 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 22:17:59,831 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 32 [2023-02-15 22:17:59,934 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:17:59,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:17:59,936 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 25 treesize of output 16 [2023-02-15 22:17:59,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:17:59,951 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:17:59,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:18:00,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:00,412 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 65 treesize of output 69 [2023-02-15 22:18:00,470 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_1191 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bcki~0#1.base|) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (or (not (<= 0 v_prenex_2)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2))) (not (<= v_prenex_2 |c_ULTIMATE.start_main_~bucket~0#1.offset|))))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (or (not (<= 0 v_prenex_2)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2))) (not (<= v_prenex_2 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_1191 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bcki~0#1.base|) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)))))) is different from false [2023-02-15 22:18:00,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:00,659 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-02-15 22:18:00,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:00,908 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 23 treesize of output 24 [2023-02-15 22:18:00,910 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:00,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:00,916 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 30 treesize of output 30 [2023-02-15 22:18:00,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:00,925 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 18 treesize of output 22 [2023-02-15 22:18:00,934 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:18:00,934 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 13 treesize of output 12 [2023-02-15 22:18:01,047 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:18:01,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829711024] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:18:01,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:18:01,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 36 [2023-02-15 22:18:01,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103270815] [2023-02-15 22:18:01,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:18:01,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 22:18:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:18:01,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 22:18:01,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1111, Unknown=14, NotChecked=68, Total=1332 [2023-02-15 22:18:01,049 INFO L87 Difference]: Start difference. First operand 195 states and 234 transitions. Second operand has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:18:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:18:05,471 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2023-02-15 22:18:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 22:18:05,471 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-15 22:18:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:18:05,472 INFO L225 Difference]: With dead ends: 238 [2023-02-15 22:18:05,472 INFO L226 Difference]: Without dead ends: 238 [2023-02-15 22:18:05,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=428, Invalid=2424, Unknown=14, NotChecked=104, Total=2970 [2023-02-15 22:18:05,473 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 480 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 58 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:18:05,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1195 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1629 Invalid, 5 Unknown, 184 Unchecked, 1.2s Time] [2023-02-15 22:18:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-02-15 22:18:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2023-02-15 22:18:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 173 states have (on average 1.4219653179190752) internal successors, (246), 204 states have internal predecessors, (246), 0 states have call successors, (0), 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:18:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 246 transitions. [2023-02-15 22:18:05,476 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 246 transitions. Word has length 38 [2023-02-15 22:18:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:18:05,476 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 246 transitions. [2023-02-15 22:18:05,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:18:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 246 transitions. [2023-02-15 22:18:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:18:05,476 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:18:05,476 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] [2023-02-15 22:18:05,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 22:18:05,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 22:18:05,682 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:18:05,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:18:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash -706370692, now seen corresponding path program 1 times [2023-02-15 22:18:05,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:18:05,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585560444] [2023-02-15 22:18:05,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:18:05,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:18:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:18:06,464 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:18:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:18:06,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585560444] [2023-02-15 22:18:06,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585560444] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:18:06,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314034468] [2023-02-15 22:18:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:18:06,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:18:06,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:18:06,466 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:18:06,468 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:18:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:18:06,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-15 22:18:06,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:18:06,598 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:18:06,622 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:18:06,622 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:18:06,656 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:18:06,663 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:18:06,791 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:18:06,791 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:18:06,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:18:06,805 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:18:06,852 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:18:06,852 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:18:06,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:18:06,862 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:18:06,883 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 22:18:06,883 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 20 treesize of output 22 [2023-02-15 22:18:06,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:18:06,939 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:18:06,939 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:18:06,943 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:18:06,961 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 22:18:06,961 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 1 case distinctions, treesize of input 35 treesize of output 26 [2023-02-15 22:18:07,156 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:18:07,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 55 [2023-02-15 22:18:07,222 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:18:07,223 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:18:07,237 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:18:07,403 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:18:07,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 55 [2023-02-15 22:18:07,437 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:18:07,438 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:18:07,444 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:18:07,542 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:18:07,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2023-02-15 22:18:07,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 22:18:07,800 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 22:18:07,800 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 21 treesize of output 26 [2023-02-15 22:18:07,841 INFO L321 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2023-02-15 22:18:07,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 52 [2023-02-15 22:18:08,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:08,244 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 22:18:08,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2023-02-15 22:18:08,249 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:08,250 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:18:08,276 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:18:08,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:18:09,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:09,119 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2023-02-15 22:18:09,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:09,325 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 142 treesize of output 146 [2023-02-15 22:18:09,402 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 26 treesize of output 22 [2023-02-15 22:18:09,741 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1348 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_arrayElimCell_112 Int) (v_ArrVal_1341 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select |c_#valid| v_arrayElimCell_112))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1341) v_arrayElimCell_112 v_ArrVal_1348) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 5) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_5 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1347 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_5) .cse0 v_ArrVal_1347) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) .cse0))) (not (= 0 (select |c_#valid| .cse0)))))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_5 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1347 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem3#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_5) .cse1 v_ArrVal_1347) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))) (not (= 0 (select |c_#valid| .cse1)))))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int) (v_prenex_5 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|))) (not (<= 0 v_prenex_4)) (not (<= v_prenex_4 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_5) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_prenex_3) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_4) 4))))) is different from false [2023-02-15 22:18:09,795 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_5 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1347 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_5) .cse1 v_ArrVal_1347) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) .cse1))) (not (= 0 (select |c_#valid| .cse1)))))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_ArrVal_1348 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_arrayElimCell_112 Int) (v_ArrVal_1341 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select |c_#valid| v_arrayElimCell_112))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1341) v_arrayElimCell_112 v_ArrVal_1348) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 5) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_5 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1347 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_5) .cse2 v_ArrVal_1347) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))) (not (= 0 (select |c_#valid| .cse2)))))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int) (v_prenex_5 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|))) (not (<= 0 v_prenex_4)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_5) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_prenex_3) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_4) 4)) (not (<= v_prenex_4 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) is different from false [2023-02-15 22:18:09,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:09,870 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 21 treesize of output 22 [2023-02-15 22:18:09,872 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:09,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:09,878 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 30 treesize of output 30 [2023-02-15 22:18:09,884 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 9 treesize of output 7 [2023-02-15 22:18:09,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:09,906 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 26 treesize of output 27 [2023-02-15 22:18:09,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:09,915 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:09,915 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 37 treesize of output 37 [2023-02-15 22:18:09,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:09,925 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 33 treesize of output 33 [2023-02-15 22:18:09,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:09,987 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 23 treesize of output 24 [2023-02-15 22:18:09,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:09,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:09,999 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 34 treesize of output 34 [2023-02-15 22:18:10,005 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 11 treesize of output 9 [2023-02-15 22:18:10,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:10,033 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 23 treesize of output 24 [2023-02-15 22:18:10,037 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:10,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:10,043 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 30 treesize of output 30 [2023-02-15 22:18:10,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:10,054 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 18 treesize of output 22 [2023-02-15 22:18:10,303 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:18:10,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314034468] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:18:10,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:18:10,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 42 [2023-02-15 22:18:10,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171671346] [2023-02-15 22:18:10,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:18:10,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-15 22:18:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:18:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-15 22:18:10,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1445, Unknown=11, NotChecked=158, Total=1806 [2023-02-15 22:18:10,306 INFO L87 Difference]: Start difference. First operand 205 states and 246 transitions. Second operand has 43 states, 42 states have (on average 2.5) internal successors, (105), 43 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:18:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:18:17,997 INFO L93 Difference]: Finished difference Result 260 states and 301 transitions. [2023-02-15 22:18:17,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 22:18:17,998 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.5) internal successors, (105), 43 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 38 [2023-02-15 22:18:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:18:17,999 INFO L225 Difference]: With dead ends: 260 [2023-02-15 22:18:17,999 INFO L226 Difference]: Without dead ends: 260 [2023-02-15 22:18:18,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=510, Invalid=3389, Unknown=15, NotChecked=246, Total=4160 [2023-02-15 22:18:18,000 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 483 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 56 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:18:18,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1343 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1821 Invalid, 4 Unknown, 365 Unchecked, 2.3s Time] [2023-02-15 22:18:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-15 22:18:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 228. [2023-02-15 22:18:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 199 states have (on average 1.4221105527638191) internal successors, (283), 227 states have internal predecessors, (283), 0 states have call successors, (0), 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:18:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 283 transitions. [2023-02-15 22:18:18,003 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 283 transitions. Word has length 38 [2023-02-15 22:18:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:18:18,003 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 283 transitions. [2023-02-15 22:18:18,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.5) internal successors, (105), 43 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:18:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 283 transitions. [2023-02-15 22:18:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:18:18,004 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:18:18,004 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] [2023-02-15 22:18:18,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:18:18,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:18:18,213 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 22:18:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:18:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash 448725100, now seen corresponding path program 1 times [2023-02-15 22:18:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:18:18,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29135922] [2023-02-15 22:18:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:18:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:18:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:18:19,152 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:18:19,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:18:19,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29135922] [2023-02-15 22:18:19,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29135922] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:18:19,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655446296] [2023-02-15 22:18:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:18:19,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:18:19,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:18:19,155 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:18:19,157 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:18:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:18:19,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-15 22:18:19,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:18:19,331 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:18:19,359 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:18:19,360 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:18:19,394 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:18:19,401 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:18:19,462 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:18:19,468 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:18:19,481 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:18:19,489 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:18:19,514 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 22:18:19,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 33 [2023-02-15 22:18:19,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:18:19,577 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:18:19,600 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 19 treesize of output 18 [2023-02-15 22:18:19,840 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:18:19,840 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:18:19,844 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:18:19,862 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:18:19,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 69 [2023-02-15 22:18:19,923 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:18:19,924 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:18:19,928 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:18:19,946 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:18:19,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 69 [2023-02-15 22:18:20,029 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:18:20,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 77 [2023-02-15 22:18:20,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 22:18:20,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:18:20,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 22:18:20,173 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-02-15 22:18:20,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2023-02-15 22:18:20,249 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:18:20,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2023-02-15 22:18:20,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:18:20,453 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:18:20,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2023-02-15 22:18:20,460 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 14 treesize of output 16 [2023-02-15 22:18:21,620 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:21,623 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:18:21,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2023-02-15 22:18:21,628 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:21,628 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:18:21,668 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:18:21,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:18:30,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:30,340 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-02-15 22:18:36,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:36,115 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 320 treesize of output 324 [2023-02-15 22:18:36,470 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 51 treesize of output 43 [2023-02-15 22:18:42,669 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse0 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse2 (store |c_#valid| .cse0 1))) (or (not (= 0 (select |c_#valid| .cse0))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_10) .cse0 v_ArrVal_1521) v_prenex_7 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) v_prenex_7)) (not (= 0 (select .cse2 v_prenex_7))) (not (<= 0 v_prenex_10)) (not (= 1 (select .cse2 .cse1))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse3 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse4 (store |c_#valid| .cse3 1))) (or (not (= 0 (select |c_#valid| .cse3))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse4 v_prenex_7))) (= .cse1 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_10) .cse3 v_ArrVal_1521) v_prenex_7 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10)) (not (<= 0 v_prenex_10)) (not (= 1 (select .cse4 .cse1))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_arrayElimCell_166 Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int))) (let ((.cse5 (store |c_#valid| v_arrayElimCell_166 1))) (or (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 1 (select .cse5 .cse1))) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_9) v_arrayElimCell_166 v_prenex_11) v_prenex_7 v_prenex_8) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) 1) (not (= 0 (select |c_#valid| v_arrayElimCell_166))) (not (<= 0 v_prenex_10)) (not (= 0 (select .cse5 v_prenex_7)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse6 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse7 (store |c_#valid| .cse6 1))) (or (not (= 0 (select |c_#valid| .cse6))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_10) .cse6 v_ArrVal_1521) v_prenex_7 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) .cse6)) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse7 v_prenex_7))) (not (<= 0 v_prenex_10)) (not (= 1 (select .cse7 .cse1))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1520 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int)) (let ((.cse8 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|))) (not (= 1 (select .cse8 .cse1))) (not (= 0 (select .cse8 |v_ULTIMATE.start_main_~item~0#1.base_41|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1514) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| v_ArrVal_1520) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1526) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 8))))))) is different from false [2023-02-15 22:18:42,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:42,913 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 26 treesize of output 27 [2023-02-15 22:18:42,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:42,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:42,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:42,939 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 30 treesize of output 30 [2023-02-15 22:18:42,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:42,962 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 40 treesize of output 40 [2023-02-15 22:18:43,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:43,012 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 27 treesize of output 28 [2023-02-15 22:18:43,019 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:43,020 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:43,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:43,037 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 33 treesize of output 33 [2023-02-15 22:18:43,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:43,114 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 51 treesize of output 51 [2023-02-15 22:18:43,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:43,283 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 24 treesize of output 25 [2023-02-15 22:18:43,289 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:43,289 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:43,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:43,307 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 30 treesize of output 30 [2023-02-15 22:18:43,314 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 9 treesize of output 7 [2023-02-15 22:18:43,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:43,374 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 26 treesize of output 27 [2023-02-15 22:18:43,380 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:43,381 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:43,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:43,400 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 34 treesize of output 34 [2023-02-15 22:18:43,406 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 11 treesize of output 9 [2023-02-15 22:18:43,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:43,477 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 29 treesize of output 30 [2023-02-15 22:18:43,485 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:43,486 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:43,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:43,504 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 37 treesize of output 37 [2023-02-15 22:18:43,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:43,528 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 55 treesize of output 51 [2023-02-15 22:18:48,743 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:18:48,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655446296] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:18:48,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:18:48,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 44 [2023-02-15 22:18:48,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466145319] [2023-02-15 22:18:48,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:18:48,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 22:18:48,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:18:48,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 22:18:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1674, Unknown=17, NotChecked=84, Total=1980 [2023-02-15 22:18:48,745 INFO L87 Difference]: Start difference. First operand 228 states and 283 transitions. Second operand has 45 states, 44 states have (on average 2.3636363636363638) internal successors, (104), 45 states have internal predecessors, (104), 0 states have call successors, (0), 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:18:53,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:19:19,938 WARN L233 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 98 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:19:43,472 WARN L233 SmtUtils]: Spent 23.31s on a formula simplification that was a NOOP. DAG size: 183 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:20:04,484 WARN L233 SmtUtils]: Spent 12.52s on a formula simplification. DAG size of input: 63 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:20:26,130 WARN L233 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 77 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:20:52,216 WARN L233 SmtUtils]: Spent 20.58s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:21:01,437 WARN L233 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 68 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:21:12,426 WARN L233 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 70 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:21:23,200 WARN L233 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 107 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)