./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-token-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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:16:39,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:16:39,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:16:39,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:16:39,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:16:39,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:16:39,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:16:39,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:16:39,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:16:39,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:16:39,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:16:39,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:16:39,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:16:39,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:16:39,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:16:39,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:16:39,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:16:39,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:16:39,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:16:39,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:16:39,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:16:39,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:16:39,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:16:39,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:16:39,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:16:39,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:16:39,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:16:39,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:16:39,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:16:39,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:16:39,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:16:39,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:16:39,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:16:39,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:16:39,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:16:39,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:16:39,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:16:39,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:16:39,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:16:39,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:16:39,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:16:39,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:16:39,912 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:16:39,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:16:39,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:16:39,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:16:39,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:16:39,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:16:39,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:16:39,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:16:39,916 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:16:39,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:16:39,917 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:16:39,917 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:16:39,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:16:39,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:16:39,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:16:39,918 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:16:39,918 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:16:39,918 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:16:39,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:16:39,919 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:16:39,919 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:16:39,919 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:16:39,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:16:39,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:16:39,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:16:39,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:16:39,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:16:39,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:16:39,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:16:39,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:16:39,921 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:16:39,922 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:16:39,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:16:39,922 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:16:39,922 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-02-15 13:16:40,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:16:40,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:16:40,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:16:40,205 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:16:40,205 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:16:40,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-02-15 13:16:41,292 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:16:41,528 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:16:41,528 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-02-15 13:16:41,538 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78001806c/e9c21dc4a10942bc88df4530832cac5c/FLAGe8c201745 [2023-02-15 13:16:41,555 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78001806c/e9c21dc4a10942bc88df4530832cac5c [2023-02-15 13:16:41,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:16:41,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:16:41,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:16:41,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:16:41,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:16:41,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:16:41" (1/1) ... [2023-02-15 13:16:41,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7da3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:41, skipping insertion in model container [2023-02-15 13:16:41,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:16:41" (1/1) ... [2023-02-15 13:16:41,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:16:41,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:16:41,906 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-02-15 13:16:41,919 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-02-15 13:16:41,922 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-02-15 13:16:41,924 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-02-15 13:16:41,927 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-02-15 13:16:41,930 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-02-15 13:16:41,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:16:41,946 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:16:41,994 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-02-15 13:16:41,998 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-02-15 13:16:42,002 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-02-15 13:16:42,004 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-02-15 13:16:42,005 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-02-15 13:16:42,007 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-02-15 13:16:42,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:16:42,036 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:16:42,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42 WrapperNode [2023-02-15 13:16:42,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:16:42,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:16:42,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:16:42,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:16:42,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,083 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-02-15 13:16:42,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:16:42,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:16:42,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:16:42,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:16:42,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,113 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:16:42,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:16:42,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:16:42,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:16:42,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (1/1) ... [2023-02-15 13:16:42,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:16:42,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:16:42,147 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 13:16:42,159 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 13:16:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:16:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:16:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:16:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:16:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:16:42,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:16:42,297 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:16:42,299 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:16:42,727 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:16:42,734 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:16:42,735 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2023-02-15 13:16:42,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:16:42 BoogieIcfgContainer [2023-02-15 13:16:42,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:16:42,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:16:42,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:16:42,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:16:42,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:16:41" (1/3) ... [2023-02-15 13:16:42,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f2c98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:16:42, skipping insertion in model container [2023-02-15 13:16:42,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:16:42" (2/3) ... [2023-02-15 13:16:42,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f2c98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:16:42, skipping insertion in model container [2023-02-15 13:16:42,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:16:42" (3/3) ... [2023-02-15 13:16:42,745 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-02-15 13:16:42,762 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:16:42,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-02-15 13:16:42,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:16:42,809 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;@38a8bded, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:16:42,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-02-15 13:16:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:16:42,817 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:42,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:16:42,818 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:42,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:42,822 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 13:16:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:42,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085859002] [2023-02-15 13:16:42,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:43,003 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 13:16:43,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:43,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085859002] [2023-02-15 13:16:43,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085859002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:43,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:43,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:16:43,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938931786] [2023-02-15 13:16:43,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:43,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:16:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:16:43,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:16:43,043 INFO L87 Difference]: Start difference. First operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 13:16:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:43,180 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2023-02-15 13:16:43,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:16:43,184 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 13:16:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:43,194 INFO L225 Difference]: With dead ends: 153 [2023-02-15 13:16:43,194 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 13:16:43,196 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 13:16:43,199 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 110 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:43,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 103 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 13:16:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2023-02-15 13:16:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 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 13:16:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2023-02-15 13:16:43,238 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 3 [2023-02-15 13:16:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:43,239 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2023-02-15 13:16:43,239 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 13:16:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2023-02-15 13:16:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:16:43,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:43,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:16:43,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:16:43,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:43,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 13:16:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:43,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531102019] [2023-02-15 13:16:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:43,344 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 13:16:43,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:43,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531102019] [2023-02-15 13:16:43,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531102019] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:43,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:43,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:16:43,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155576558] [2023-02-15 13:16:43,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:43,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:16:43,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:16:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:16:43,348 INFO L87 Difference]: Start difference. First operand 131 states and 133 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 13:16:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:43,466 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2023-02-15 13:16:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:16:43,467 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 13:16:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:43,474 INFO L225 Difference]: With dead ends: 156 [2023-02-15 13:16:43,475 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 13:16:43,475 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 13:16:43,476 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 115 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:43,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 105 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 13:16:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2023-02-15 13:16:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2023-02-15 13:16:43,485 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 3 [2023-02-15 13:16:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:43,485 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2023-02-15 13:16:43,485 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 13:16:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2023-02-15 13:16:43,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:16:43,486 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:43,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:43,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:16:43,486 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:43,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:43,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112020, now seen corresponding path program 1 times [2023-02-15 13:16:43,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:43,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409145448] [2023-02-15 13:16:43,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:43,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:43,651 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 13:16:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:43,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409145448] [2023-02-15 13:16:43,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409145448] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:43,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:43,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:16:43,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810468390] [2023-02-15 13:16:43,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:43,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:16:43,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:43,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:16:43,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:16:43,654 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:43,891 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2023-02-15 13:16:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:16:43,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 13:16:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:43,893 INFO L225 Difference]: With dead ends: 241 [2023-02-15 13:16:43,893 INFO L226 Difference]: Without dead ends: 241 [2023-02-15 13:16:43,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:16:43,897 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 273 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:43,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 113 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:16:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-15 13:16:43,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 167. [2023-02-15 13:16:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 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 13:16:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2023-02-15 13:16:43,928 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 9 [2023-02-15 13:16:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:43,928 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2023-02-15 13:16:43,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2023-02-15 13:16:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:16:43,929 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:43,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:43,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:16:43,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:43,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112019, now seen corresponding path program 1 times [2023-02-15 13:16:43,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:43,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687162656] [2023-02-15 13:16:43,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:44,029 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 13:16:44,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:44,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687162656] [2023-02-15 13:16:44,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687162656] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:44,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:44,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:16:44,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112375060] [2023-02-15 13:16:44,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:44,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:16:44,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:44,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:16:44,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:16:44,037 INFO L87 Difference]: Start difference. First operand 167 states and 198 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:44,152 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2023-02-15 13:16:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:16:44,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 13:16:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:44,154 INFO L225 Difference]: With dead ends: 157 [2023-02-15 13:16:44,154 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 13:16:44,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:16:44,163 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 184 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:44,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 74 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 13:16:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2023-02-15 13:16:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2023-02-15 13:16:44,179 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 9 [2023-02-15 13:16:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:44,179 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2023-02-15 13:16:44,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2023-02-15 13:16:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:16:44,180 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:44,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:44,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:16:44,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:44,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2023-02-15 13:16:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:44,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373103466] [2023-02-15 13:16:44,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:44,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:44,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:44,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373103466] [2023-02-15 13:16:44,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373103466] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:44,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:44,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:16:44,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103089807] [2023-02-15 13:16:44,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:44,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:16:44,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:16:44,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:16:44,461 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:44,601 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2023-02-15 13:16:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:16:44,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 13:16:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:44,602 INFO L225 Difference]: With dead ends: 151 [2023-02-15 13:16:44,602 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 13:16:44,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:16:44,605 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:44,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 278 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 13:16:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-02-15 13:16:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 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 13:16:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2023-02-15 13:16:44,615 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 12 [2023-02-15 13:16:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:44,616 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2023-02-15 13:16:44,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2023-02-15 13:16:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:16:44,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:44,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:44,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:16:44,617 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:44,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2023-02-15 13:16:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:44,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760854383] [2023-02-15 13:16:44,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:44,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:44,740 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 13:16:44,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:44,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760854383] [2023-02-15 13:16:44,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760854383] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:44,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:44,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:16:44,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732872066] [2023-02-15 13:16:44,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:44,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:16:44,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:44,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:16:44,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:16:44,742 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:44,866 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2023-02-15 13:16:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:16:44,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 13:16:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:44,867 INFO L225 Difference]: With dead ends: 150 [2023-02-15 13:16:44,867 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 13:16:44,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:16:44,869 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 8 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:44,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 283 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 13:16:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-02-15 13:16:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 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 13:16:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2023-02-15 13:16:44,873 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 12 [2023-02-15 13:16:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:44,874 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2023-02-15 13:16:44,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2023-02-15 13:16:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:16:44,875 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:44,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:44,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:16:44,876 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:44,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash -896738186, now seen corresponding path program 1 times [2023-02-15 13:16:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:44,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304761997] [2023-02-15 13:16:44,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:44,983 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 13:16:44,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:44,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304761997] [2023-02-15 13:16:44,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304761997] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:44,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:44,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:16:44,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304312734] [2023-02-15 13:16:44,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:44,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:16:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:44,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:16:44,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:16:44,986 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:45,122 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2023-02-15 13:16:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:16:45,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 13:16:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:45,123 INFO L225 Difference]: With dead ends: 149 [2023-02-15 13:16:45,123 INFO L226 Difference]: Without dead ends: 149 [2023-02-15 13:16:45,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:16:45,125 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 12 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:45,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 275 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-15 13:16:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2023-02-15 13:16:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2023-02-15 13:16:45,129 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 14 [2023-02-15 13:16:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:45,129 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2023-02-15 13:16:45,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2023-02-15 13:16:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:16:45,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:45,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:45,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:16:45,131 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:45,131 INFO L85 PathProgramCache]: Analyzing trace with hash -896738185, now seen corresponding path program 1 times [2023-02-15 13:16:45,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:45,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574998425] [2023-02-15 13:16:45,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:45,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:45,320 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 13:16:45,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:45,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574998425] [2023-02-15 13:16:45,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574998425] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:45,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:45,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:16:45,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990829774] [2023-02-15 13:16:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:45,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:16:45,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:45,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:16:45,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:16:45,334 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:45,471 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2023-02-15 13:16:45,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:16:45,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 13:16:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:45,474 INFO L225 Difference]: With dead ends: 148 [2023-02-15 13:16:45,475 INFO L226 Difference]: Without dead ends: 148 [2023-02-15 13:16:45,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:16:45,476 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 5 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:45,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 273 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:45,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-15 13:16:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-02-15 13:16:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2023-02-15 13:16:45,480 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 14 [2023-02-15 13:16:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:45,481 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2023-02-15 13:16:45,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2023-02-15 13:16:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:16:45,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:45,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:45,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:16:45,483 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2023-02-15 13:16:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:45,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099299182] [2023-02-15 13:16:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:45,737 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 13:16:45,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:45,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099299182] [2023-02-15 13:16:45,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099299182] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:45,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:45,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:16:45,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238334580] [2023-02-15 13:16:45,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:45,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:16:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:45,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:16:45,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:16:45,741 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:45,994 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2023-02-15 13:16:45,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:16:45,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 13:16:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:45,995 INFO L225 Difference]: With dead ends: 152 [2023-02-15 13:16:45,995 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 13:16:45,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:16:45,996 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 188 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:45,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 188 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:16:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 13:16:45,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2023-02-15 13:16:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 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 13:16:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2023-02-15 13:16:45,999 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 16 [2023-02-15 13:16:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:46,000 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2023-02-15 13:16:46,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2023-02-15 13:16:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:16:46,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:46,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:46,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:16:46,001 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:46,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2023-02-15 13:16:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:46,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255586443] [2023-02-15 13:16:46,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:46,272 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 13:16:46,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:46,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255586443] [2023-02-15 13:16:46,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255586443] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:46,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:46,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:16:46,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930078664] [2023-02-15 13:16:46,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:46,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:16:46,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:46,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:16:46,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:16:46,274 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:46,774 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2023-02-15 13:16:46,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:16:46,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 13:16:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:46,776 INFO L225 Difference]: With dead ends: 149 [2023-02-15 13:16:46,776 INFO L226 Difference]: Without dead ends: 149 [2023-02-15 13:16:46,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-02-15 13:16:46,777 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 188 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:46,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 282 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:16:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-15 13:16:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2023-02-15 13:16:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 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 13:16:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2023-02-15 13:16:46,780 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 16 [2023-02-15 13:16:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:46,780 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2023-02-15 13:16:46,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2023-02-15 13:16:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:16:46,781 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:46,781 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 13:16:46,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:16:46,781 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:46,781 INFO L85 PathProgramCache]: Analyzing trace with hash -30672293, now seen corresponding path program 1 times [2023-02-15 13:16:46,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:46,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051072066] [2023-02-15 13:16:46,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:46,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:46,959 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 13:16:46,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:46,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051072066] [2023-02-15 13:16:46,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051072066] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:46,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:46,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:16:46,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853683608] [2023-02-15 13:16:46,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:46,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:16:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:46,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:16:46,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:16:46,961 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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 13:16:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:47,181 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2023-02-15 13:16:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:16:47,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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 13:16:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:47,183 INFO L225 Difference]: With dead ends: 126 [2023-02-15 13:16:47,183 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 13:16:47,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:16:47,184 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 65 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:47,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 253 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:16:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 13:16:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2023-02-15 13:16:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 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 13:16:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2023-02-15 13:16:47,186 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 17 [2023-02-15 13:16:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:47,187 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2023-02-15 13:16:47,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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 13:16:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2023-02-15 13:16:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:16:47,187 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:47,187 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 13:16:47,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:16:47,187 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash -30672292, now seen corresponding path program 1 times [2023-02-15 13:16:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:47,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458374104] [2023-02-15 13:16:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:47,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:47,402 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 13:16:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:47,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458374104] [2023-02-15 13:16:47,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458374104] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:47,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:47,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:16:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359636726] [2023-02-15 13:16:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:47,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:16:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:47,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:16:47,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:16:47,405 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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 13:16:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:47,665 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2023-02-15 13:16:47,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:16:47,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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 13:16:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:47,667 INFO L225 Difference]: With dead ends: 125 [2023-02-15 13:16:47,667 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 13:16:47,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:16:47,668 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 63 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:47,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 263 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:16:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 13:16:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2023-02-15 13:16:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 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 13:16:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2023-02-15 13:16:47,671 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 17 [2023-02-15 13:16:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:47,671 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2023-02-15 13:16:47,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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 13:16:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2023-02-15 13:16:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:16:47,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:47,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:47,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:16:47,672 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:47,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:47,675 INFO L85 PathProgramCache]: Analyzing trace with hash -3964873, now seen corresponding path program 1 times [2023-02-15 13:16:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:47,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376672844] [2023-02-15 13:16:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:47,774 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 13:16:47,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:47,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376672844] [2023-02-15 13:16:47,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376672844] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:47,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:47,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:16:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421256220] [2023-02-15 13:16:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:47,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:16:47,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:47,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:16:47,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:16:47,777 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:47,870 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2023-02-15 13:16:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:16:47,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 13:16:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:47,871 INFO L225 Difference]: With dead ends: 123 [2023-02-15 13:16:47,872 INFO L226 Difference]: Without dead ends: 123 [2023-02-15 13:16:47,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:16:47,873 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 146 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:47,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 113 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-15 13:16:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2023-02-15 13:16:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2023-02-15 13:16:47,877 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 18 [2023-02-15 13:16:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:47,877 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2023-02-15 13:16:47,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2023-02-15 13:16:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 13:16:47,881 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:47,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:47,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 13:16:47,881 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:47,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1069806106, now seen corresponding path program 1 times [2023-02-15 13:16:47,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:47,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448787423] [2023-02-15 13:16:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:47,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448787423] [2023-02-15 13:16:47,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448787423] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:47,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:47,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:16:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458962917] [2023-02-15 13:16:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:47,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:16:47,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:47,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:16:47,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:16:47,948 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:48,037 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2023-02-15 13:16:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:16:48,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 13:16:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:48,038 INFO L225 Difference]: With dead ends: 181 [2023-02-15 13:16:48,038 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 13:16:48,039 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 13:16:48,039 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 179 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:48,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 135 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 13:16:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2023-02-15 13:16:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2023-02-15 13:16:48,042 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 20 [2023-02-15 13:16:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:48,043 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2023-02-15 13:16:48,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2023-02-15 13:16:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:16:48,043 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:48,043 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 13:16:48,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:16:48,044 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash 684226449, now seen corresponding path program 1 times [2023-02-15 13:16:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:48,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12047999] [2023-02-15 13:16:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:48,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:48,743 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 13:16:48,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:48,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12047999] [2023-02-15 13:16:48,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12047999] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:48,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:48,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-15 13:16:48,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006005156] [2023-02-15 13:16:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:48,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 13:16:48,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:48,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 13:16:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:16:48,745 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 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 13:16:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:49,403 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2023-02-15 13:16:49,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 13:16:49,404 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 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 13:16:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:49,405 INFO L225 Difference]: With dead ends: 225 [2023-02-15 13:16:49,405 INFO L226 Difference]: Without dead ends: 225 [2023-02-15 13:16:49,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2023-02-15 13:16:49,405 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 283 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:49,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 490 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:16:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-15 13:16:49,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 133. [2023-02-15 13:16:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2023-02-15 13:16:49,409 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 25 [2023-02-15 13:16:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:49,409 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2023-02-15 13:16:49,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 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 13:16:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2023-02-15 13:16:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:16:49,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:49,410 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 13:16:49,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:16:49,411 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:49,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash 684193678, now seen corresponding path program 1 times [2023-02-15 13:16:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:49,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849813557] [2023-02-15 13:16:49,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:49,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:49,460 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 13:16:49,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:49,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849813557] [2023-02-15 13:16:49,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849813557] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:49,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:49,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:16:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016032566] [2023-02-15 13:16:49,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:49,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:16:49,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:16:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:16:49,462 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:49,547 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2023-02-15 13:16:49,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:16:49,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 13:16:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:49,548 INFO L225 Difference]: With dead ends: 131 [2023-02-15 13:16:49,548 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 13:16:49,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:16:49,549 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:49,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 236 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 13:16:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-02-15 13:16:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2023-02-15 13:16:49,552 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 25 [2023-02-15 13:16:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:49,552 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2023-02-15 13:16:49,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2023-02-15 13:16:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:16:49,553 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:49,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:49,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 13:16:49,554 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862923, now seen corresponding path program 1 times [2023-02-15 13:16:49,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:49,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666957198] [2023-02-15 13:16:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:49,840 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 13:16:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:49,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666957198] [2023-02-15 13:16:49,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666957198] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:49,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:49,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:16:49,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026977961] [2023-02-15 13:16:49,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:49,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:16:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:16:49,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:16:49,844 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:50,211 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2023-02-15 13:16:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 13:16:50,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-15 13:16:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:50,212 INFO L225 Difference]: With dead ends: 185 [2023-02-15 13:16:50,212 INFO L226 Difference]: Without dead ends: 185 [2023-02-15 13:16:50,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:16:50,213 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 237 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:50,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 286 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:16:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-15 13:16:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2023-02-15 13:16:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 0 states have call successors, (0), 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 13:16:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2023-02-15 13:16:50,216 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 28 [2023-02-15 13:16:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:50,216 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2023-02-15 13:16:50,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2023-02-15 13:16:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:16:50,217 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:50,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:50,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 13:16:50,217 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862922, now seen corresponding path program 1 times [2023-02-15 13:16:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:50,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130840096] [2023-02-15 13:16:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:50,634 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 13:16:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:50,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130840096] [2023-02-15 13:16:50,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130840096] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:50,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:50,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:16:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194367244] [2023-02-15 13:16:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:50,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:16:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:50,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:16:50,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:16:50,637 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:51,112 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2023-02-15 13:16:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:16:51,113 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-15 13:16:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:51,114 INFO L225 Difference]: With dead ends: 217 [2023-02-15 13:16:51,114 INFO L226 Difference]: Without dead ends: 217 [2023-02-15 13:16:51,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:16:51,115 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 179 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:51,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 341 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:16:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-15 13:16:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2023-02-15 13:16:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2023-02-15 13:16:51,118 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 28 [2023-02-15 13:16:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:51,119 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2023-02-15 13:16:51,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2023-02-15 13:16:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:16:51,119 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:51,119 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] [2023-02-15 13:16:51,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 13:16:51,120 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:51,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:51,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1818276907, now seen corresponding path program 1 times [2023-02-15 13:16:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:51,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227289964] [2023-02-15 13:16:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:51,653 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 13:16:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:51,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227289964] [2023-02-15 13:16:51,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227289964] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:51,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:51,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-15 13:16:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001063801] [2023-02-15 13:16:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:51,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:16:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:16:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:16:51,655 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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 13:16:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:52,252 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2023-02-15 13:16:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:16:52,253 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 13:16:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:52,254 INFO L225 Difference]: With dead ends: 215 [2023-02-15 13:16:52,254 INFO L226 Difference]: Without dead ends: 215 [2023-02-15 13:16:52,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:16:52,255 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 368 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:52,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 447 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:16:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-15 13:16:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2023-02-15 13:16:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 137 states have internal predecessors, (148), 0 states have call successors, (0), 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 13:16:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2023-02-15 13:16:52,258 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 30 [2023-02-15 13:16:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:52,258 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2023-02-15 13:16:52,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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 13:16:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2023-02-15 13:16:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 13:16:52,259 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:52,259 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] [2023-02-15 13:16:52,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 13:16:52,259 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -245371248, now seen corresponding path program 1 times [2023-02-15 13:16:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:52,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418466361] [2023-02-15 13:16:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:52,327 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 13:16:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:52,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418466361] [2023-02-15 13:16:52,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418466361] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:52,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:52,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:16:52,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280877964] [2023-02-15 13:16:52,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:52,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:16:52,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:52,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:16:52,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:16:52,330 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 13:16:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:52,421 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2023-02-15 13:16:52,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:16:52,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 13:16:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:52,422 INFO L225 Difference]: With dead ends: 136 [2023-02-15 13:16:52,423 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 13:16:52,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:16:52,423 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:52,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 211 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 13:16:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-02-15 13:16:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 135 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 13:16:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2023-02-15 13:16:52,431 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 36 [2023-02-15 13:16:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:52,431 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2023-02-15 13:16:52,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 13:16:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2023-02-15 13:16:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:16:52,434 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:52,434 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 13:16:52,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 13:16:52,434 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash 984809453, now seen corresponding path program 1 times [2023-02-15 13:16:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:52,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628955376] [2023-02-15 13:16:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:52,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:52,507 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 13:16:52,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:52,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628955376] [2023-02-15 13:16:52,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628955376] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:52,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:52,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:16:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943147626] [2023-02-15 13:16:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:52,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:16:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:52,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:16:52,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:16:52,511 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 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 13:16:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:52,606 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2023-02-15 13:16:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:16:52,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 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 13:16:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:52,607 INFO L225 Difference]: With dead ends: 152 [2023-02-15 13:16:52,607 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 13:16:52,607 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 13:16:52,608 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 136 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:52,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 92 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 13:16:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2023-02-15 13:16:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 137 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2023-02-15 13:16:52,613 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 37 [2023-02-15 13:16:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:52,613 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2023-02-15 13:16:52,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 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 13:16:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2023-02-15 13:16:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:16:52,614 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:52,614 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] [2023-02-15 13:16:52,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 13:16:52,614 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:16:52,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:52,615 INFO L85 PathProgramCache]: Analyzing trace with hash -27234752, now seen corresponding path program 1 times [2023-02-15 13:16:52,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:52,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865287801] [2023-02-15 13:16:52,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:52,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:53,491 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 13:16:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865287801] [2023-02-15 13:16:53,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865287801] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:16:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939381660] [2023-02-15 13:16:53,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:53,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:16:53,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:16:53,499 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 13:16:53,503 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 13:16:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:53,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 13:16:53,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:16:53,744 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 13:16:53,771 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 13:16:53,841 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:16:53,841 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 13:16:53,924 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 13:16:53,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:16:53,937 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 13:16:54,076 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:54,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 13:16:54,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 13:16:54,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 13:16:54,171 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 13:16:54,210 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 13:16:54,233 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 13:16:54,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:16:54,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:16:54,257 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 13:16:54,350 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:54,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-02-15 13:16:54,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 13:16:54,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 13:16:54,399 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 13:16:54,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:16:54,429 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 13:16:54,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:16:54,533 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-02-15 13:16:54,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:54,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-02-15 13:16:54,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-02-15 13:16:54,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-02-15 13:16:55,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:55,336 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 13:16:55,339 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 37 treesize of output 29 [2023-02-15 13:16:55,346 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 8 treesize of output 6 [2023-02-15 13:16:55,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:55,356 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 41 treesize of output 42 [2023-02-15 13:16:55,361 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 76 treesize of output 68 [2023-02-15 13:16:55,367 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 32 treesize of output 30 [2023-02-15 13:17:02,432 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:02,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:02,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2023-02-15 13:17:02,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:02,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-02-15 13:17:02,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:17:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:04,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939381660] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:17:04,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:17:04,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [20, 17] total 43 [2023-02-15 13:17:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503355177] [2023-02-15 13:17:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:04,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 13:17:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 13:17:04,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1420, Unknown=53, NotChecked=80, Total=1806 [2023-02-15 13:17:04,009 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 13:17:10,799 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) 0)))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0)) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) .cse1) (or (not .cse1) (forall ((v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_19 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_872) v_arrayElimCell_19 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869))) (or (forall ((v_arrayElimCell_19 Int) (v_ArrVal_872 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_872) v_arrayElimCell_19 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_6| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) 0)))))) is different from false [2023-02-15 13:17:11,357 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_872) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_873) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_872) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_873) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))) is different from false [2023-02-15 13:17:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:16,752 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2023-02-15 13:17:16,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 13:17:16,753 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 13:17:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:16,757 INFO L225 Difference]: With dead ends: 199 [2023-02-15 13:17:16,757 INFO L226 Difference]: Without dead ends: 199 [2023-02-15 13:17:16,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=396, Invalid=3045, Unknown=111, NotChecked=354, Total=3906 [2023-02-15 13:17:16,760 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 193 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 25 mSolverCounterUnsat, 51 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 51 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:16,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 770 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1146 Invalid, 51 Unknown, 155 Unchecked, 3.2s Time] [2023-02-15 13:17:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-15 13:17:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 138. [2023-02-15 13:17:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.280701754385965) internal successors, (146), 137 states have internal predecessors, (146), 0 states have call successors, (0), 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 13:17:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2023-02-15 13:17:16,763 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 37 [2023-02-15 13:17:16,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:16,763 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2023-02-15 13:17:16,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 13:17:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2023-02-15 13:17:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 13:17:16,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:16,764 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 13:17:16,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 13:17:16,970 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,SelfDestructingSolverStorable21 [2023-02-15 13:17:16,970 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:17:16,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash 421565270, now seen corresponding path program 1 times [2023-02-15 13:17:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:16,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444602416] [2023-02-15 13:17:16,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:17,357 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 13:17:17,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:17,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444602416] [2023-02-15 13:17:17,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444602416] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:17,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:17,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:17:17,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279820258] [2023-02-15 13:17:17,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:17,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:17:17,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:17,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:17:17,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:17:17,359 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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 13:17:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:17,798 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2023-02-15 13:17:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:17:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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 13:17:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:17,800 INFO L225 Difference]: With dead ends: 202 [2023-02-15 13:17:17,800 INFO L226 Difference]: Without dead ends: 202 [2023-02-15 13:17:17,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:17:17,801 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 196 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:17,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 362 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:17:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-15 13:17:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2023-02-15 13:17:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 146 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2023-02-15 13:17:17,804 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 38 [2023-02-15 13:17:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:17,804 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2023-02-15 13:17:17,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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 13:17:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2023-02-15 13:17:17,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:17:17,804 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:17,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:17,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 13:17:17,806 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:17:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:17,806 INFO L85 PathProgramCache]: Analyzing trace with hash 183621750, now seen corresponding path program 1 times [2023-02-15 13:17:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:17,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737409236] [2023-02-15 13:17:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:17,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:18,161 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 13:17:18,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:18,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737409236] [2023-02-15 13:17:18,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737409236] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:18,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:18,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:17:18,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950726973] [2023-02-15 13:17:18,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:18,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:17:18,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:18,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:17:18,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:17:18,163 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 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 13:17:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:18,713 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2023-02-15 13:17:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:17:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 13:17:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:18,714 INFO L225 Difference]: With dead ends: 201 [2023-02-15 13:17:18,714 INFO L226 Difference]: Without dead ends: 201 [2023-02-15 13:17:18,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:17:18,715 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 184 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:18,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 353 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:17:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-02-15 13:17:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 148. [2023-02-15 13:17:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 147 states have internal predecessors, (157), 0 states have call successors, (0), 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 13:17:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2023-02-15 13:17:18,718 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 39 [2023-02-15 13:17:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:18,718 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2023-02-15 13:17:18,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 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 13:17:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2023-02-15 13:17:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:17:18,719 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:18,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:18,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 13:17:18,719 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:17:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086814, now seen corresponding path program 1 times [2023-02-15 13:17:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:18,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012510617] [2023-02-15 13:17:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:19,220 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 13:17:19,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:19,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012510617] [2023-02-15 13:17:19,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012510617] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:17:19,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137738644] [2023-02-15 13:17:19,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:19,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:17:19,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:17:19,225 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 13:17:19,229 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 13:17:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:19,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-15 13:17:19,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:17:19,475 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:17:19,476 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 13:17:19,510 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 13:17:19,618 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:19,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 13:17:19,668 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:19,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 13:17:20,147 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:20,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:20,150 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 13:17:20,185 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 13:17:20,188 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 13:17:20,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:17:20,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:20,262 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 25 treesize of output 29 [2023-02-15 13:17:20,664 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1063))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1063))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) is different from false [2023-02-15 13:17:20,698 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1063))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1063))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse2 |v_ULTIMATE.start_main_~x~0#1.offset_63|) (select .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2023-02-15 13:17:20,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:20,735 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 37 treesize of output 30 [2023-02-15 13:17:20,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:20,747 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 141 treesize of output 128 [2023-02-15 13:17:20,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:20,763 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 112 treesize of output 111 [2023-02-15 13:17:20,771 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 102 treesize of output 98 [2023-02-15 13:17:20,910 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:17:20,910 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 69 treesize of output 1 [2023-02-15 13:17:21,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:21,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2023-02-15 13:17:21,435 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 13:17:21,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137738644] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:17:21,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:17:21,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 40 [2023-02-15 13:17:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286527256] [2023-02-15 13:17:21,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:17:21,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 13:17:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:21,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 13:17:21,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1302, Unknown=6, NotChecked=150, Total=1640 [2023-02-15 13:17:21,437 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 states have internal predecessors, (97), 0 states have call successors, (0), 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 13:17:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:22,882 INFO L93 Difference]: Finished difference Result 200 states and 204 transitions. [2023-02-15 13:17:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:17:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 13:17:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:22,884 INFO L225 Difference]: With dead ends: 200 [2023-02-15 13:17:22,884 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 13:17:22,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=472, Invalid=2182, Unknown=6, NotChecked=202, Total=2862 [2023-02-15 13:17:22,885 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 553 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 376 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:22,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 753 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1288 Invalid, 0 Unknown, 376 Unchecked, 0.9s Time] [2023-02-15 13:17:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 13:17:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 154. [2023-02-15 13:17:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 153 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2023-02-15 13:17:22,889 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 39 [2023-02-15 13:17:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:22,889 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2023-02-15 13:17:22,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 states have internal predecessors, (97), 0 states have call successors, (0), 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 13:17:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2023-02-15 13:17:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:17:22,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:22,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:22,908 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 13:17:23,101 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,SelfDestructingSolverStorable24 [2023-02-15 13:17:23,101 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:17:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086815, now seen corresponding path program 1 times [2023-02-15 13:17:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:23,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551429108] [2023-02-15 13:17:23,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:23,365 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 13:17:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:23,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551429108] [2023-02-15 13:17:23,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551429108] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:17:23,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826125718] [2023-02-15 13:17:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:23,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:17:23,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:17:23,370 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 13:17:23,413 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 13:17:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:23,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 13:17:23,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:17:23,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:23,824 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 13:17:23,828 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:23,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:23,832 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 28 treesize of output 19 [2023-02-15 13:17:23,854 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 13:17:23,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:17:23,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:23,915 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 34 treesize of output 38 [2023-02-15 13:17:24,013 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-02-15 13:17:24,014 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 45 treesize of output 36 [2023-02-15 13:17:24,027 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-02-15 13:17:24,027 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 22 treesize of output 14 [2023-02-15 13:17:24,143 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 13:17:24,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826125718] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:17:24,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:17:24,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-02-15 13:17:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888907048] [2023-02-15 13:17:24,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:17:24,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 13:17:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:24,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 13:17:24,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:17:24,145 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 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 13:17:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:24,917 INFO L93 Difference]: Finished difference Result 220 states and 225 transitions. [2023-02-15 13:17:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:17:24,918 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 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 39 [2023-02-15 13:17:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:24,919 INFO L225 Difference]: With dead ends: 220 [2023-02-15 13:17:24,919 INFO L226 Difference]: Without dead ends: 220 [2023-02-15 13:17:24,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2023-02-15 13:17:24,920 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 436 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:24,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 454 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:17:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-15 13:17:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 164. [2023-02-15 13:17:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2023-02-15 13:17:24,923 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 39 [2023-02-15 13:17:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:24,923 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2023-02-15 13:17:24,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 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 13:17:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2023-02-15 13:17:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:17:24,923 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:24,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:24,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:17:25,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:17:25,130 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:17:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1397307224, now seen corresponding path program 1 times [2023-02-15 13:17:25,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:25,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913788037] [2023-02-15 13:17:25,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:25,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:25,254 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 13:17:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:25,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913788037] [2023-02-15 13:17:25,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913788037] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:25,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:25,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:17:25,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865045082] [2023-02-15 13:17:25,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:25,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:17:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:17:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:17:25,256 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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 13:17:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:25,513 INFO L93 Difference]: Finished difference Result 192 states and 199 transitions. [2023-02-15 13:17:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:17:25,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2023-02-15 13:17:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:25,515 INFO L225 Difference]: With dead ends: 192 [2023-02-15 13:17:25,515 INFO L226 Difference]: Without dead ends: 192 [2023-02-15 13:17:25,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:17:25,516 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 88 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:25,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 290 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:17:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-15 13:17:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2023-02-15 13:17:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 170 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2023-02-15 13:17:25,521 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 40 [2023-02-15 13:17:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:25,521 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2023-02-15 13:17:25,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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 13:17:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2023-02-15 13:17:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:17:25,522 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:25,522 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:25,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 13:17:25,522 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:17:25,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:25,523 INFO L85 PathProgramCache]: Analyzing trace with hash 402357860, now seen corresponding path program 1 times [2023-02-15 13:17:25,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:25,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051548206] [2023-02-15 13:17:25,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:25,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:26,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:26,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051548206] [2023-02-15 13:17:26,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051548206] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:17:26,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972697080] [2023-02-15 13:17:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:26,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:17:26,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:17:26,771 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 13:17:26,773 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 13:17:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:26,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 13:17:26,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:17:26,916 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 13:17:27,004 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:17:27,004 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 13:17:27,041 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 13:17:27,148 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:27,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 13:17:27,242 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:27,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 13:17:27,330 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:27,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 13:17:27,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:27,354 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 13:17:27,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:17:27,408 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:17:27,409 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 1 case distinctions, treesize of input 27 treesize of output 22 [2023-02-15 13:17:27,535 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-15 13:17:27,535 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 34 treesize of output 38 [2023-02-15 13:17:27,624 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:17:27,624 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 60 treesize of output 53 [2023-02-15 13:17:27,811 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:27,817 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2023-02-15 13:17:27,818 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 27 [2023-02-15 13:17:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:27,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:17:30,241 INFO L321 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2023-02-15 13:17:30,242 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 45 treesize of output 44 [2023-02-15 13:17:30,253 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc6#1.base|)) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1347)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2023-02-15 13:17:30,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:30,328 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 32 treesize of output 33 [2023-02-15 13:17:30,342 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_1346))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1347)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) is different from false [2023-02-15 13:17:30,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:30,828 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 134 treesize of output 86 [2023-02-15 13:17:30,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:30,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 11906 treesize of output 10149 [2023-02-15 13:17:30,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:30,910 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 10134 treesize of output 9268 [2023-02-15 13:17:30,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:30,928 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 9246 treesize of output 7556 [2023-02-15 13:17:30,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:30,948 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 7542 treesize of output 6910 [2023-02-15 13:17:30,961 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 6902 treesize of output 6646 [2023-02-15 13:17:31,026 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-02-15 13:17:31,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61