./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 574ddb4e 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-?-574ddb4 [2023-02-18 21:40:12,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 21:40:12,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 21:40:12,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 21:40:12,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 21:40:12,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 21:40:12,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 21:40:12,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 21:40:12,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 21:40:12,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 21:40:12,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 21:40:12,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 21:40:12,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 21:40:12,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 21:40:12,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 21:40:12,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 21:40:12,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 21:40:12,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 21:40:12,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 21:40:12,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 21:40:12,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 21:40:12,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 21:40:12,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 21:40:12,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 21:40:12,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 21:40:12,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 21:40:12,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 21:40:12,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 21:40:12,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 21:40:12,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 21:40:12,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 21:40:12,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 21:40:12,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 21:40:12,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 21:40:12,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 21:40:12,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 21:40:12,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 21:40:12,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 21:40:12,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 21:40:12,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 21:40:12,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 21:40:12,936 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-18 21:40:12,954 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 21:40:12,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 21:40:12,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 21:40:12,957 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 21:40:12,958 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 21:40:12,958 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 21:40:12,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 21:40:12,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 21:40:12,959 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 21:40:12,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 21:40:12,960 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 21:40:12,960 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 21:40:12,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 21:40:12,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 21:40:12,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 21:40:12,960 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 21:40:12,960 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 21:40:12,960 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 21:40:12,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 21:40:12,961 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 21:40:12,961 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 21:40:12,961 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 21:40:12,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 21:40:12,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 21:40:12,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 21:40:12,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 21:40:12,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 21:40:12,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 21:40:12,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 21:40:12,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 21:40:12,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 21:40:12,963 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 21:40:12,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 21:40:12,963 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 21:40:12,963 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-18 21:40:13,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 21:40:13,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 21:40:13,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 21:40:13,220 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 21:40:13,226 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 21:40:13,227 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-18 21:40:14,161 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 21:40:14,383 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 21:40:14,383 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-02-18 21:40:14,398 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46a3447f7/7bdd08d5fbc94abab6679428a1326e80/FLAG3f6a2484b [2023-02-18 21:40:14,728 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46a3447f7/7bdd08d5fbc94abab6679428a1326e80 [2023-02-18 21:40:14,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 21:40:14,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 21:40:14,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 21:40:14,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 21:40:14,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 21:40:14,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 09:40:14" (1/1) ... [2023-02-18 21:40:14,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6219a640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:14, skipping insertion in model container [2023-02-18 21:40:14,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 09:40:14" (1/1) ... [2023-02-18 21:40:14,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 21:40:14,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 21:40:14,966 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-18 21:40:14,978 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-18 21:40:14,979 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-18 21:40:14,981 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-18 21:40:14,984 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-18 21:40:14,986 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-18 21:40:14,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 21:40:14,999 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 21:40:15,035 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-18 21:40:15,050 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-18 21:40:15,051 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-18 21:40:15,051 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-18 21:40:15,052 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-18 21:40:15,053 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-18 21:40:15,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 21:40:15,071 INFO L208 MainTranslator]: Completed translation [2023-02-18 21:40:15,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15 WrapperNode [2023-02-18 21:40:15,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 21:40:15,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 21:40:15,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 21:40:15,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 21:40:15,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,108 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-02-18 21:40:15,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 21:40:15,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 21:40:15,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 21:40:15,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 21:40:15,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,136 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 21:40:15,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 21:40:15,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 21:40:15,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 21:40:15,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (1/1) ... [2023-02-18 21:40:15,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 21:40:15,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 21:40:15,161 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-18 21:40:15,180 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-18 21:40:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-18 21:40:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-18 21:40:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 21:40:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 21:40:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 21:40:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 21:40:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 21:40:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 21:40:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 21:40:15,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 21:40:15,255 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 21:40:15,256 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 21:40:15,493 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 21:40:15,497 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 21:40:15,498 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2023-02-18 21:40:15,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:40:15 BoogieIcfgContainer [2023-02-18 21:40:15,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 21:40:15,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 21:40:15,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 21:40:15,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 21:40:15,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 09:40:14" (1/3) ... [2023-02-18 21:40:15,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e203b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:40:15, skipping insertion in model container [2023-02-18 21:40:15,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:40:15" (2/3) ... [2023-02-18 21:40:15,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e203b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:40:15, skipping insertion in model container [2023-02-18 21:40:15,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:40:15" (3/3) ... [2023-02-18 21:40:15,504 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-02-18 21:40:15,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 21:40:15,541 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-02-18 21:40:15,575 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 21:40:15,594 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;@42cb34e3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 21:40:15,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-02-18 21:40:15,597 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-18 21:40:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-18 21:40:15,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:15,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-18 21:40:15,602 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-18 21:40:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:15,605 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-18 21:40:15,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:15,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935486934] [2023-02-18 21:40:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:15,768 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-18 21:40:15,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:15,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935486934] [2023-02-18 21:40:15,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935486934] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:15,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:15,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 21:40:15,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031053467] [2023-02-18 21:40:15,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:15,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 21:40:15,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:15,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 21:40:15,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 21:40:15,804 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-18 21:40:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:15,906 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2023-02-18 21:40:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 21:40:15,908 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-18 21:40:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:15,914 INFO L225 Difference]: With dead ends: 153 [2023-02-18 21:40:15,914 INFO L226 Difference]: Without dead ends: 151 [2023-02-18 21:40:15,915 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-18 21:40:15,918 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-18 21:40:15,919 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-18 21:40:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-18 21:40:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2023-02-18 21:40:15,941 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-18 21:40:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2023-02-18 21:40:15,943 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 3 [2023-02-18 21:40:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:15,944 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2023-02-18 21:40:15,944 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-18 21:40:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2023-02-18 21:40:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-18 21:40:15,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:15,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-18 21:40:15,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 21:40:15,945 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-18 21:40:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-18 21:40:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:15,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236951289] [2023-02-18 21:40:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:15,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:16,032 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-18 21:40:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:16,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236951289] [2023-02-18 21:40:16,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236951289] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:16,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:16,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 21:40:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859597761] [2023-02-18 21:40:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:16,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 21:40:16,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:16,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 21:40:16,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 21:40:16,055 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-18 21:40:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:16,158 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2023-02-18 21:40:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 21:40:16,159 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-18 21:40:16,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:16,161 INFO L225 Difference]: With dead ends: 156 [2023-02-18 21:40:16,163 INFO L226 Difference]: Without dead ends: 156 [2023-02-18 21:40:16,163 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-18 21:40:16,164 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-18 21:40:16,165 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-18 21:40:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-18 21:40:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2023-02-18 21:40:16,173 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-18 21:40:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2023-02-18 21:40:16,177 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 3 [2023-02-18 21:40:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:16,177 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2023-02-18 21:40:16,177 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-18 21:40:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2023-02-18 21:40:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 21:40:16,178 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:16,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:40:16,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 21:40:16,178 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-18 21:40:16,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112020, now seen corresponding path program 1 times [2023-02-18 21:40:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:16,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583084517] [2023-02-18 21:40:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:16,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:16,385 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-18 21:40:16,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:16,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583084517] [2023-02-18 21:40:16,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583084517] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:16,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:16,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 21:40:16,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919232075] [2023-02-18 21:40:16,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:16,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 21:40:16,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:16,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 21:40:16,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:40:16,387 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-18 21:40:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:16,568 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2023-02-18 21:40:16,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 21:40:16,569 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-18 21:40:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:16,570 INFO L225 Difference]: With dead ends: 241 [2023-02-18 21:40:16,570 INFO L226 Difference]: Without dead ends: 241 [2023-02-18 21:40:16,570 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-18 21:40:16,571 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 273 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-18 21:40:16,571 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-18 21:40:16,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-18 21:40:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 167. [2023-02-18 21:40:16,578 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-18 21:40:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2023-02-18 21:40:16,579 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 9 [2023-02-18 21:40:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:16,579 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2023-02-18 21:40:16,580 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-18 21:40:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2023-02-18 21:40:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 21:40:16,580 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:16,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:40:16,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 21:40:16,580 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-18 21:40:16,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:16,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112019, now seen corresponding path program 1 times [2023-02-18 21:40:16,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:16,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146194773] [2023-02-18 21:40:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:16,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:16,641 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-18 21:40:16,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:16,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146194773] [2023-02-18 21:40:16,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146194773] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:16,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:16,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 21:40:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159988929] [2023-02-18 21:40:16,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:16,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 21:40:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 21:40:16,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:40:16,648 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-18 21:40:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:16,748 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2023-02-18 21:40:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:40:16,748 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-18 21:40:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:16,750 INFO L225 Difference]: With dead ends: 157 [2023-02-18 21:40:16,750 INFO L226 Difference]: Without dead ends: 157 [2023-02-18 21:40:16,752 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-18 21:40:16,757 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-18 21:40:16,758 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-18 21:40:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-18 21:40:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2023-02-18 21:40:16,770 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-18 21:40:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2023-02-18 21:40:16,774 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 9 [2023-02-18 21:40:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:16,774 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2023-02-18 21:40:16,774 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-18 21:40:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2023-02-18 21:40:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 21:40:16,775 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:16,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:40:16,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 21:40:16,775 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-18 21:40:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:16,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2023-02-18 21:40:16,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:16,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306766525] [2023-02-18 21:40:16,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:40:16,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:16,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306766525] [2023-02-18 21:40:16,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306766525] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:16,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:16,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:40:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717658023] [2023-02-18 21:40:16,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:16,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:40:16,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:16,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:40:16,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:40:16,967 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-18 21:40:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:17,076 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2023-02-18 21:40:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 21:40:17,077 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-18 21:40:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:17,078 INFO L225 Difference]: With dead ends: 151 [2023-02-18 21:40:17,078 INFO L226 Difference]: Without dead ends: 151 [2023-02-18 21:40:17,078 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-18 21:40:17,079 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-18 21:40:17,079 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-18 21:40:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-18 21:40:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-02-18 21:40:17,093 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-18 21:40:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2023-02-18 21:40:17,095 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 12 [2023-02-18 21:40:17,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:17,095 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2023-02-18 21:40:17,095 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-18 21:40:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2023-02-18 21:40:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 21:40:17,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:17,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:40:17,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 21:40:17,096 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-18 21:40:17,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:17,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2023-02-18 21:40:17,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:17,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164403675] [2023-02-18 21:40:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:17,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:17,169 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-18 21:40:17,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:17,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164403675] [2023-02-18 21:40:17,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164403675] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:17,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:17,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:40:17,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331721995] [2023-02-18 21:40:17,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:17,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:40:17,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:17,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:40:17,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:40:17,171 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-18 21:40:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:17,274 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2023-02-18 21:40:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 21:40:17,274 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-18 21:40:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:17,275 INFO L225 Difference]: With dead ends: 150 [2023-02-18 21:40:17,275 INFO L226 Difference]: Without dead ends: 150 [2023-02-18 21:40:17,275 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-18 21:40:17,276 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-18 21:40:17,276 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-18 21:40:17,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-18 21:40:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-02-18 21:40:17,279 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-18 21:40:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2023-02-18 21:40:17,280 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 12 [2023-02-18 21:40:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:17,280 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2023-02-18 21:40:17,280 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-18 21:40:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2023-02-18 21:40:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 21:40:17,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:17,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:40:17,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 21:40:17,282 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-18 21:40:17,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash -896738186, now seen corresponding path program 1 times [2023-02-18 21:40:17,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:17,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392935947] [2023-02-18 21:40:17,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:17,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:17,347 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-18 21:40:17,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:17,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392935947] [2023-02-18 21:40:17,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392935947] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:17,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:17,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:40:17,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906190162] [2023-02-18 21:40:17,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:17,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:40:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:17,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:40:17,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:40:17,349 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-18 21:40:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:17,438 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2023-02-18 21:40:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 21:40:17,439 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-18 21:40:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:17,439 INFO L225 Difference]: With dead ends: 149 [2023-02-18 21:40:17,439 INFO L226 Difference]: Without dead ends: 149 [2023-02-18 21:40:17,440 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-18 21:40:17,441 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-18 21:40:17,441 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-18 21:40:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-18 21:40:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2023-02-18 21:40:17,443 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-18 21:40:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2023-02-18 21:40:17,444 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 14 [2023-02-18 21:40:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:17,444 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2023-02-18 21:40:17,445 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-18 21:40:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2023-02-18 21:40:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 21:40:17,445 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:17,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:40:17,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 21:40:17,446 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-18 21:40:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash -896738185, now seen corresponding path program 1 times [2023-02-18 21:40:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:17,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081992017] [2023-02-18 21:40:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:17,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:17,574 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-18 21:40:17,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:17,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081992017] [2023-02-18 21:40:17,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081992017] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:17,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:17,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:40:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825941864] [2023-02-18 21:40:17,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:17,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:40:17,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:40:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:40:17,577 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-18 21:40:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:17,664 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2023-02-18 21:40:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 21:40:17,665 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-18 21:40:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:17,667 INFO L225 Difference]: With dead ends: 148 [2023-02-18 21:40:17,667 INFO L226 Difference]: Without dead ends: 148 [2023-02-18 21:40:17,667 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-18 21:40:17,668 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-18 21:40:17,668 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-18 21:40:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-18 21:40:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-02-18 21:40:17,671 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-18 21:40:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2023-02-18 21:40:17,672 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 14 [2023-02-18 21:40:17,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:17,672 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2023-02-18 21:40:17,672 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-18 21:40:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2023-02-18 21:40:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 21:40:17,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:17,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:40:17,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 21:40:17,674 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-18 21:40:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2023-02-18 21:40:17,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:17,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282182556] [2023-02-18 21:40:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:17,801 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-18 21:40:17,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:17,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282182556] [2023-02-18 21:40:17,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282182556] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:17,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:17,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 21:40:17,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878971941] [2023-02-18 21:40:17,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:17,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 21:40:17,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:17,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 21:40:17,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-18 21:40:17,803 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-18 21:40:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:17,953 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2023-02-18 21:40:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 21:40:17,954 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-18 21:40:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:17,954 INFO L225 Difference]: With dead ends: 152 [2023-02-18 21:40:17,955 INFO L226 Difference]: Without dead ends: 152 [2023-02-18 21:40:17,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-18 21:40:17,955 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.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:40:17,956 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.1s Time] [2023-02-18 21:40:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-18 21:40:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2023-02-18 21:40:17,972 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-18 21:40:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2023-02-18 21:40:17,973 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 16 [2023-02-18 21:40:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:17,973 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2023-02-18 21:40:17,974 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-18 21:40:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2023-02-18 21:40:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 21:40:17,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:17,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:40:17,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 21:40:17,975 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-18 21:40:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2023-02-18 21:40:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:17,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038258914] [2023-02-18 21:40:17,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:18,117 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-18 21:40:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:18,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038258914] [2023-02-18 21:40:18,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038258914] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:18,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:18,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 21:40:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294537732] [2023-02-18 21:40:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:18,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 21:40:18,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:18,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 21:40:18,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-18 21:40:18,119 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-18 21:40:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:18,343 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2023-02-18 21:40:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 21:40:18,343 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-18 21:40:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:18,344 INFO L225 Difference]: With dead ends: 149 [2023-02-18 21:40:18,344 INFO L226 Difference]: Without dead ends: 149 [2023-02-18 21:40:18,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-02-18 21:40:18,344 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 188 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:40:18,345 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.2s Time] [2023-02-18 21:40:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-18 21:40:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2023-02-18 21:40:18,346 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-18 21:40:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2023-02-18 21:40:18,347 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 16 [2023-02-18 21:40:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:18,347 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2023-02-18 21:40:18,347 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-18 21:40:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2023-02-18 21:40:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 21:40:18,347 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:18,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:40:18,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 21:40:18,348 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-18 21:40:18,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:18,348 INFO L85 PathProgramCache]: Analyzing trace with hash -30672293, now seen corresponding path program 1 times [2023-02-18 21:40:18,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:18,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013336657] [2023-02-18 21:40:18,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:18,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:18,440 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-18 21:40:18,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013336657] [2023-02-18 21:40:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013336657] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:18,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:18,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 21:40:18,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319433448] [2023-02-18 21:40:18,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:18,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 21:40:18,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:18,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 21:40:18,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-18 21:40:18,442 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-18 21:40:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:18,591 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2023-02-18 21:40:18,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 21:40:18,592 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-18 21:40:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:18,592 INFO L225 Difference]: With dead ends: 126 [2023-02-18 21:40:18,593 INFO L226 Difference]: Without dead ends: 126 [2023-02-18 21:40:18,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-18 21:40:18,593 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.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:40:18,593 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.1s Time] [2023-02-18 21:40:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-18 21:40:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2023-02-18 21:40:18,595 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-18 21:40:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2023-02-18 21:40:18,596 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 17 [2023-02-18 21:40:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:18,596 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2023-02-18 21:40:18,596 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-18 21:40:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2023-02-18 21:40:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 21:40:18,596 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:18,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:40:18,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 21:40:18,597 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-18 21:40:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash -30672292, now seen corresponding path program 1 times [2023-02-18 21:40:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:18,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640175457] [2023-02-18 21:40:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:18,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:18,732 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-18 21:40:18,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:18,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640175457] [2023-02-18 21:40:18,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640175457] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:18,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:18,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 21:40:18,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333257869] [2023-02-18 21:40:18,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:18,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 21:40:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:18,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 21:40:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-18 21:40:18,734 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-18 21:40:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:18,874 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2023-02-18 21:40:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 21:40:18,875 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-18 21:40:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:18,875 INFO L225 Difference]: With dead ends: 125 [2023-02-18 21:40:18,875 INFO L226 Difference]: Without dead ends: 125 [2023-02-18 21:40:18,876 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-18 21:40:18,876 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.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:40:18,876 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.1s Time] [2023-02-18 21:40:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-18 21:40:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2023-02-18 21:40:18,878 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-18 21:40:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2023-02-18 21:40:18,878 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 17 [2023-02-18 21:40:18,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:18,878 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2023-02-18 21:40:18,878 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-18 21:40:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2023-02-18 21:40:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 21:40:18,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:18,879 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-18 21:40:18,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 21:40:18,879 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-18 21:40:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash -3964873, now seen corresponding path program 1 times [2023-02-18 21:40:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:18,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165714885] [2023-02-18 21:40:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:18,992 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-18 21:40:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:18,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165714885] [2023-02-18 21:40:18,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165714885] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:18,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:18,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-18 21:40:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112645540] [2023-02-18 21:40:18,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:18,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 21:40:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 21:40:18,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-18 21:40:18,994 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 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-18 21:40:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:19,220 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2023-02-18 21:40:19,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 21:40:19,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 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-18 21:40:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:19,226 INFO L225 Difference]: With dead ends: 143 [2023-02-18 21:40:19,226 INFO L226 Difference]: Without dead ends: 143 [2023-02-18 21:40:19,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-02-18 21:40:19,227 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 178 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:40:19,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 248 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 21:40:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-18 21:40:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119. [2023-02-18 21:40:19,229 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-18 21:40:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2023-02-18 21:40:19,229 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 18 [2023-02-18 21:40:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:19,229 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2023-02-18 21:40:19,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 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-18 21:40:19,229 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2023-02-18 21:40:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 21:40:19,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:19,230 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-18 21:40:19,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 21:40:19,230 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-18 21:40:19,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:19,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1069806106, now seen corresponding path program 1 times [2023-02-18 21:40:19,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:19,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200465692] [2023-02-18 21:40:19,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:19,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:19,278 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-18 21:40:19,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:19,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200465692] [2023-02-18 21:40:19,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200465692] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:19,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:19,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:40:19,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534314457] [2023-02-18 21:40:19,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:19,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 21:40:19,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:19,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 21:40:19,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:40:19,280 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-18 21:40:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:19,325 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2023-02-18 21:40:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:40:19,325 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-18 21:40:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:19,326 INFO L225 Difference]: With dead ends: 181 [2023-02-18 21:40:19,326 INFO L226 Difference]: Without dead ends: 181 [2023-02-18 21:40:19,326 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-18 21:40:19,327 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 179 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:40:19,327 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.0s Time] [2023-02-18 21:40:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-18 21:40:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2023-02-18 21:40:19,328 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-18 21:40:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2023-02-18 21:40:19,329 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 20 [2023-02-18 21:40:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:19,329 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2023-02-18 21:40:19,329 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-18 21:40:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2023-02-18 21:40:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 21:40:19,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:19,329 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-18 21:40:19,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-18 21:40:19,330 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-18 21:40:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash 684226449, now seen corresponding path program 1 times [2023-02-18 21:40:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:19,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377082232] [2023-02-18 21:40:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:19,652 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-18 21:40:19,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:19,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377082232] [2023-02-18 21:40:19,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377082232] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:19,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:19,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-18 21:40:19,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142513262] [2023-02-18 21:40:19,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:19,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 21:40:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:19,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 21:40:19,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-02-18 21:40:19,654 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-18 21:40:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:20,080 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2023-02-18 21:40:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 21:40:20,080 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-18 21:40:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:20,081 INFO L225 Difference]: With dead ends: 225 [2023-02-18 21:40:20,081 INFO L226 Difference]: Without dead ends: 225 [2023-02-18 21:40:20,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2023-02-18 21:40:20,082 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 324 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 21:40:20,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 531 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 21:40:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-18 21:40:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 133. [2023-02-18 21:40:20,083 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-18 21:40:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2023-02-18 21:40:20,084 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 25 [2023-02-18 21:40:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:20,084 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2023-02-18 21:40:20,084 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-18 21:40:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2023-02-18 21:40:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 21:40:20,084 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:20,084 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-18 21:40:20,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-18 21:40:20,085 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-18 21:40:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:20,085 INFO L85 PathProgramCache]: Analyzing trace with hash 684193678, now seen corresponding path program 1 times [2023-02-18 21:40:20,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:20,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013145008] [2023-02-18 21:40:20,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:20,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:20,115 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-18 21:40:20,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:20,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013145008] [2023-02-18 21:40:20,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013145008] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:20,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:20,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:40:20,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913274139] [2023-02-18 21:40:20,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:20,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:40:20,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:20,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:40:20,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:40:20,117 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-18 21:40:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:20,188 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2023-02-18 21:40:20,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:40:20,188 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-18 21:40:20,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:20,189 INFO L225 Difference]: With dead ends: 131 [2023-02-18 21:40:20,189 INFO L226 Difference]: Without dead ends: 131 [2023-02-18 21:40:20,189 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-18 21:40:20,190 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-18 21:40:20,190 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-18 21:40:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-18 21:40:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-02-18 21:40:20,191 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-18 21:40:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2023-02-18 21:40:20,192 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 25 [2023-02-18 21:40:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:20,192 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2023-02-18 21:40:20,192 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-18 21:40:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2023-02-18 21:40:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 21:40:20,193 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:20,193 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-18 21:40:20,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-18 21:40:20,193 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-18 21:40:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:20,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862923, now seen corresponding path program 1 times [2023-02-18 21:40:20,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:20,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378997810] [2023-02-18 21:40:20,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:20,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:20,428 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-18 21:40:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:20,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378997810] [2023-02-18 21:40:20,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378997810] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:20,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:20,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-18 21:40:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673789776] [2023-02-18 21:40:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:20,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 21:40:20,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:20,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 21:40:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 21:40:20,431 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-18 21:40:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:20,689 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2023-02-18 21:40:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 21:40:20,689 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-18 21:40:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:20,691 INFO L225 Difference]: With dead ends: 185 [2023-02-18 21:40:20,691 INFO L226 Difference]: Without dead ends: 185 [2023-02-18 21:40:20,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2023-02-18 21:40:20,691 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 230 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:40:20,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 307 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 21:40:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-18 21:40:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2023-02-18 21:40:20,693 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-18 21:40:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2023-02-18 21:40:20,694 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 28 [2023-02-18 21:40:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:20,694 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2023-02-18 21:40:20,694 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-18 21:40:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2023-02-18 21:40:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 21:40:20,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:20,695 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-18 21:40:20,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-18 21:40:20,695 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-18 21:40:20,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862922, now seen corresponding path program 1 times [2023-02-18 21:40:20,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:20,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610441236] [2023-02-18 21:40:20,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:20,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:20,947 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-18 21:40:20,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:20,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610441236] [2023-02-18 21:40:20,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610441236] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:20,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:20,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-18 21:40:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273867533] [2023-02-18 21:40:20,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:20,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 21:40:20,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:20,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 21:40:20,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 21:40:20,950 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-18 21:40:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:21,227 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2023-02-18 21:40:21,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 21:40:21,227 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-18 21:40:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:21,228 INFO L225 Difference]: With dead ends: 217 [2023-02-18 21:40:21,228 INFO L226 Difference]: Without dead ends: 217 [2023-02-18 21:40:21,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2023-02-18 21:40:21,229 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 229 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:40:21,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 311 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 21:40:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-18 21:40:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2023-02-18 21:40:21,230 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-18 21:40:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2023-02-18 21:40:21,231 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 28 [2023-02-18 21:40:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:21,231 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2023-02-18 21:40:21,231 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-18 21:40:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2023-02-18 21:40:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 21:40:21,232 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:21,232 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-18 21:40:21,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-18 21:40:21,232 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-18 21:40:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1818276907, now seen corresponding path program 1 times [2023-02-18 21:40:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:21,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534820948] [2023-02-18 21:40:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:21,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:21,542 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-18 21:40:21,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:21,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534820948] [2023-02-18 21:40:21,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534820948] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:21,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:21,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-18 21:40:21,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082257382] [2023-02-18 21:40:21,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:21,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 21:40:21,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:21,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 21:40:21,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 21:40:21,544 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-18 21:40:21,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:21,868 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2023-02-18 21:40:21,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 21:40:21,869 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-18 21:40:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:21,869 INFO L225 Difference]: With dead ends: 215 [2023-02-18 21:40:21,869 INFO L226 Difference]: Without dead ends: 215 [2023-02-18 21:40:21,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2023-02-18 21:40:21,870 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 349 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:40:21,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 419 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 21:40:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-18 21:40:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2023-02-18 21:40:21,872 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-18 21:40:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2023-02-18 21:40:21,872 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 30 [2023-02-18 21:40:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:21,872 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2023-02-18 21:40:21,872 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-18 21:40:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2023-02-18 21:40:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 21:40:21,873 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:21,873 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-18 21:40:21,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-18 21:40:21,873 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-18 21:40:21,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash -245371248, now seen corresponding path program 1 times [2023-02-18 21:40:21,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:21,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744486513] [2023-02-18 21:40:21,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:21,905 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-18 21:40:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:21,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744486513] [2023-02-18 21:40:21,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744486513] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:21,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:21,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:40:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864822744] [2023-02-18 21:40:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:21,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:40:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:40:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:40:21,907 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-18 21:40:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:21,971 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2023-02-18 21:40:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:40:21,971 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-18 21:40:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:21,972 INFO L225 Difference]: With dead ends: 136 [2023-02-18 21:40:21,972 INFO L226 Difference]: Without dead ends: 136 [2023-02-18 21:40:21,972 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-18 21:40:21,973 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-18 21:40:21,973 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-18 21:40:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-18 21:40:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-02-18 21:40:21,975 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-18 21:40:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2023-02-18 21:40:21,975 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 36 [2023-02-18 21:40:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:21,975 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2023-02-18 21:40:21,975 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-18 21:40:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2023-02-18 21:40:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-18 21:40:21,976 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:21,976 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-18 21:40:21,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-18 21:40:21,976 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-18 21:40:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash 984809453, now seen corresponding path program 1 times [2023-02-18 21:40:21,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:21,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103529582] [2023-02-18 21:40:21,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:21,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:22,015 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-18 21:40:22,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:22,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103529582] [2023-02-18 21:40:22,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103529582] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:40:22,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:40:22,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 21:40:22,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873743275] [2023-02-18 21:40:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:22,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 21:40:22,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 21:40:22,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:40:22,017 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-18 21:40:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:40:22,087 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2023-02-18 21:40:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 21:40:22,088 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-18 21:40:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:40:22,089 INFO L225 Difference]: With dead ends: 152 [2023-02-18 21:40:22,089 INFO L226 Difference]: Without dead ends: 152 [2023-02-18 21:40:22,089 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-18 21:40:22,089 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-18 21:40:22,090 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-18 21:40:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-18 21:40:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2023-02-18 21:40:22,091 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-18 21:40:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2023-02-18 21:40:22,092 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 37 [2023-02-18 21:40:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:40:22,092 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2023-02-18 21:40:22,092 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-18 21:40:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2023-02-18 21:40:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-18 21:40:22,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:40:22,093 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-18 21:40:22,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-18 21:40:22,093 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-18 21:40:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:40:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash -27234752, now seen corresponding path program 1 times [2023-02-18 21:40:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:40:22,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943945986] [2023-02-18 21:40:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:40:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:22,535 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-18 21:40:22,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:40:22,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943945986] [2023-02-18 21:40:22,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943945986] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:40:22,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302609889] [2023-02-18 21:40:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:40:22,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 21:40:22,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 21:40:22,542 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-18 21:40:22,555 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-18 21:40:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:40:22,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-18 21:40:22,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:40:22,726 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-18 21:40:22,733 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-18 21:40:22,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:22,754 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 39 [2023-02-18 21:40:22,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:40:22,800 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 45 treesize of output 44 [2023-02-18 21:40:22,804 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-18 21:40:22,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:22,866 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 65 treesize of output 74 [2023-02-18 21:40:22,871 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 42 treesize of output 44 [2023-02-18 21:40:22,882 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 58 treesize of output 44 [2023-02-18 21:40:22,916 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 52 treesize of output 32 [2023-02-18 21:40:22,956 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-18 21:40:22,964 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-18 21:40:22,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:22,969 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 26 [2023-02-18 21:40:22,984 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-18 21:40:22,987 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 20 treesize of output 22 [2023-02-18 21:40:23,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:23,025 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 50 [2023-02-18 21:40:23,029 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 22 treesize of output 24 [2023-02-18 21:40:23,053 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-18 21:40:23,067 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-18 21:40:23,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:23,081 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-18 21:40:23,089 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-18 21:40:23,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:40:23,160 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|) (+ 8 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) is different from false [2023-02-18 21:40:23,165 WARN L837 $PredicateComparison]: unable to prove that (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|) (+ 8 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) is different from false [2023-02-18 21:40:23,168 WARN L837 $PredicateComparison]: unable to prove that (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|) (+ 8 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) is different from false [2023-02-18 21:40:23,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:23,174 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-18 21:40:23,177 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-18 21:40:23,181 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-18 21:40:23,613 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~head~0#1.offset|))) (and (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_865) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_869))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_865) .cse2 v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) (not (= 0 (select |c_#valid| .cse2)))))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_865) .cse3 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))))) is different from false [2023-02-18 21:40:23,627 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.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_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| .cse1 v_ArrVal_865) .cse0 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| .cse1 v_ArrVal_865) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_869))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (= (select (select (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| .cse1 v_ArrVal_865) .cse4 v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (not (= 0 (select |c_#valid| .cse4)))))))) is different from false [2023-02-18 21:40:23,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:23,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2023-02-18 21:40:23,653 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 149 treesize of output 137 [2023-02-18 21:40:23,657 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 68 treesize of output 64 [2023-02-18 21:40:23,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:23,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2023-02-18 21:40:23,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2023-02-18 21:40:23,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2023-02-18 21:40:23,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:23,736 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 60 treesize of output 52 [2023-02-18 21:40:23,741 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 97 treesize of output 85 [2023-02-18 21:40:23,745 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 42 treesize of output 38 [2023-02-18 21:40:48,607 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:48,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 70 [2023-02-18 21:40:48,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,615 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-18 21:40:48,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-02-18 21:40:48,623 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,627 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 19 treesize of output 11 [2023-02-18 21:40:48,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-02-18 21:40:48,632 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-02-18 21:40:48,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-18 21:40:48,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-02-18 21:40:48,642 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-18 21:40:48,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-02-18 21:40:48,652 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,658 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 82 treesize of output 66 [2023-02-18 21:40:48,661 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 130 treesize of output 118 [2023-02-18 21:40:48,663 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 110 treesize of output 94 [2023-02-18 21:40:48,675 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:48,677 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 60 treesize of output 52 [2023-02-18 21:40:48,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,682 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 165 treesize of output 141 [2023-02-18 21:40:48,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-02-18 21:40:48,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-02-18 21:40:48,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:48,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2023-02-18 21:40:48,698 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,699 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,701 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,705 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 87 treesize of output 71 [2023-02-18 21:40:48,708 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 130 treesize of output 118 [2023-02-18 21:40:48,710 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 121 treesize of output 101 [2023-02-18 21:40:48,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,777 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 75 treesize of output 63 [2023-02-18 21:40:48,780 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 118 treesize of output 102 [2023-02-18 21:40:48,782 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 114 treesize of output 102 [2023-02-18 21:40:48,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:48,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2023-02-18 21:40:48,804 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,805 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,808 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:48,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2023-02-18 21:40:48,810 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,815 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-18 21:40:48,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-02-18 21:40:48,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:48,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 73 [2023-02-18 21:40:48,827 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,827 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,831 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:40:48,832 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 125 treesize of output 91 [2023-02-18 21:40:48,836 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:40:48,840 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 1387 treesize of output 1303 [2023-02-18 21:40:48,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 574 [2023-02-18 21:40:48,847 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 531 treesize of output 491 [2023-02-18 21:40:48,850 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 519 treesize of output 447 [2023-02-18 21:40:58,254 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-18 21:40:58,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302609889] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 21:40:58,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-18 21:40:58,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [20, 17] total 42 [2023-02-18 21:40:58,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609531964] [2023-02-18 21:40:58,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:40:58,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 21:40:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:40:58,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 21:40:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1076, Unknown=42, NotChecked=370, Total=1722 [2023-02-18 21:40:58,256 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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-18 21:40:59,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:01,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:02,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:08,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:13,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:15,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:17,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:19,942 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse11 (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)))) (.cse12 (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| 1))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_57| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_ArrVal_874 (Array Int Int))) (or (not (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_57| v_ArrVal_862)) |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (not (= 1 (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_57| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_57| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (not (= 1 (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (not (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_57| v_ArrVal_862)))) (or (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_57| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_57| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_57| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (let ((.cse5 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (not (= 1 (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_57| v_ArrVal_862)) |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_869))) (or (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= 0 (select .cse5 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_57| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (let ((.cse7 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (not (= 1 (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_57| v_ArrVal_862)))) (let ((.cse8 (store .cse10 |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_869))) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse9 (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (or (= (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))) (= (select (select (store .cse9 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))) (= (select (select (store .cse8 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (not (= 0 (select .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_57| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse11 (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (not (= 0 (select .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (forall ((v_arrayElimCell_27 Int)) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (or (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~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|) .cse2) 0))) (= v_arrayElimCell_27 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (not (= 0 (select .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))))) (or .cse11 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (not (= 0 (select .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))) (or .cse11 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (not (= 0 (select .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (or (let ((.cse17 (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (let ((.cse21 (or .cse17 (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_ArrVal_874 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#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|) .cse2) 0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))))) (.cse40 (or .cse17 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))) (.cse24 (or .cse17 (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_ArrVal_874 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#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|) .cse2) 0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))))) (.cse30 (forall ((v_ArrVal_862 Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))) (.cse18 (not .cse17)) (.cse19 (or .cse17 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_869))) (or (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (forall ((v_ArrVal_865 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (or (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))) (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (or .cse17 (and (or .cse18 (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) .cse19)) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (or (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#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|) .cse2) 0)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) .cse21)) (or .cse17 (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_869))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (or (= (select (select (store (store .cse22 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (forall ((v_ArrVal_865 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select (select (store (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))) (= (select (select (store .cse22 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (or .cse18 (and .cse24 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (or (= (select (select (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#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|) .cse2) 0) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (= (select (select (store (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))))) (or .cse17 (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_869))) (or (= (select (select (store (store .cse26 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse26 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))))))) (or .cse18 (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (let ((.cse27 (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869))) (or (= (select (select (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#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|) .cse2) 0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))))) (or .cse18 (let ((.cse29 (forall ((v_arrayElimCell_25 Int)) (not (= 0 (select |c_#valid| v_arrayElimCell_25)))))) (and (or .cse17 .cse29 .cse30) (or (and (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_25 v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (not (= 0 (select |c_#valid| v_arrayElimCell_25))))) (or .cse17 .cse29)) .cse18) (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_862 Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (or (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_25 v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))) (not (= 0 (select |c_#valid| v_arrayElimCell_25)))))))) .cse21 (or .cse17 (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_23 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_869))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (= (select (select (store (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (or .cse18 (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_arrayElimCell_23 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (or (= (select (select (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#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|) .cse2) 0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))))))) (or .cse18 (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (let ((.cse35 (store (store .cse36 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (or (= (select (select (store (store .cse35 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store (store .cse36 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))) (= (select (select (store .cse35 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (or .cse17 (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_23 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (= (select (select (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (or .cse18 (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_arrayElimCell_23 Int) (v_ArrVal_874 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))))) (or .cse18 (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869))) (or (= (select (select (store (store .cse38 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse38 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))))) (or .cse17 (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (or (= (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (forall ((v_ArrVal_865 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select (select (store (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (or .cse18 (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) .cse40)) (or .cse17 (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))))))) (or (and (or .cse18 (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) .cse40)) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (or (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store (store (store .cse41 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store .cse41 |c_ULTIMATE.start_main_#t~malloc3#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|) .cse2) 0)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (or .cse18 (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) .cse40)) .cse24) .cse17) .cse24 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (or (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store (store (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#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|) .cse2) 0)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))) .cse18) (or .cse17 (and (or (and .cse17 (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_arrayElimCell_25 Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_25 v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))) .cse18) (or .cse17 .cse30) (forall ((v_ArrVal_862 Int) (v_arrayElimCell_25 Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (or (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store (store (store .cse43 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_25 v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store .cse43 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (or .cse18 (and .cse19 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_862)))) (or (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#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|) .cse2) 0)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))))) (not (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)))) (= (select .cse16 (+ 8 |c_ULTIMATE.start_main_~x~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_57| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_57| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (let ((.cse45 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (not (= 1 (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (not (= 0 (select .cse45 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_57| v_ArrVal_862)))) (let ((.cse46 (store .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_869))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (or (= (select (select (store (store .cse46 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (forall ((v_ArrVal_865 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select (select (store (store (store (store .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))) (= (select (select (store .cse46 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_57| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_57| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (let ((.cse48 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (not (= 1 (select .cse48 |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_23 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_57| v_ArrVal_862)))) (let ((.cse49 (store .cse50 |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_869))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (= (select (select (store (store .cse49 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store (store .cse50 |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse49 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (not (= 0 (select .cse48 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_57| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_57| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (let ((.cse51 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (not (= 1 (select .cse51 |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (not (= 0 (select .cse51 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (forall ((v_ArrVal_862 Int) (v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_57| v_ArrVal_862)))) (or (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store (store (store .cse52 |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store .cse52 |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))))))) (or .cse11 (and (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (or (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_865) v_arrayElimCell_25 v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))) (not (= 0 (select .cse12 v_arrayElimCell_25))))) (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_865) v_arrayElimCell_25 v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (not (= 0 (select .cse12 v_arrayElimCell_25))))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (not (= 0 (select .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse53 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869))) (or (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (or (= (select (select (store (store .cse53 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))) (= (select (select (store .cse53 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse54 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869))) (or (not (= 0 (select .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (= (select (select (store (store .cse54 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse54 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) .cse11) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_arrayElimCell_27 Int) (v_ArrVal_874 (Array Int Int))) (or (not (= 0 (select .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (= v_arrayElimCell_27 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_865) v_arrayElimCell_27 v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))) .cse11) (or (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse55 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_865) v_arrayElimCell_23 v_ArrVal_869))) (or (not (= 0 (select .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (= (select (select (store (store .cse55 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse55 |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~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|) .cse2) 0)))) .cse11) (= (select .cse1 .cse2) 0) (or .cse11 (forall ((v_arrayElimCell_25 Int)) (not (= 0 (select .cse12 v_arrayElimCell_25))))))) is different from true [2023-02-18 21:41:21,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:24,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:26,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:28,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:31,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:33,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:35,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:38,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:41,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:45,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:47,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:49,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:51,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:56,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:41:58,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:00,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:02,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:05,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:08,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:09,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:16,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:20,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:22,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:24,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:24,209 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)))) (.cse1 (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| 1)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_#t~malloc6#1.base|))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (not (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|)))) (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 (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (forall ((v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 Int)) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_872) v_arrayElimCell_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))) (or (not .cse4) (and (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_872 (Array Int Int)) (v_arrayElimCell_21 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_21 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)) .cse4)) (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (not (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc6#1.base_6|))))) (or .cse0 (forall ((v_arrayElimCell_25 Int)) (not (= 0 (select .cse1 v_arrayElimCell_25))))) (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|) .cse3) 0)) .cse4))) is different from false [2023-02-18 21:42:25,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:27,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:30,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:32,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:34,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:36,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:38,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:40,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:43,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:45,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:49,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:52,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:53,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:55,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:42:58,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:01,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:03,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:06,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:09,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:12,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:14,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:16,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:18,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:20,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:22,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:24,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:26,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:34,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:41,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:45,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:47,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:49,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:52,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:56,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:43:59,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-18 21:44:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:44:08,407 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2023-02-18 21:44:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 21:44:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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-18 21:44:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:44:08,410 INFO L225 Difference]: With dead ends: 193 [2023-02-18 21:44:08,410 INFO L226 Difference]: Without dead ends: 193 [2023-02-18 21:44:08,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 12 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=302, Invalid=1735, Unknown=61, NotChecked=658, Total=2756 [2023-02-18 21:44:08,411 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 173 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 16 mSolverCounterUnsat, 80 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 161.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 80 IncrementalHoareTripleChecker+Unknown, 700 IncrementalHoareTripleChecker+Unchecked, 163.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:44:08,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 608 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 733 Invalid, 80 Unknown, 700 Unchecked, 163.1s Time] [2023-02-18 21:44:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-02-18 21:44:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 138. [2023-02-18 21:44:08,413 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-18 21:44:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2023-02-18 21:44:08,415 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 37 [2023-02-18 21:44:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:44:08,415 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2023-02-18 21:44:08,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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-18 21:44:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2023-02-18 21:44:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 21:44:08,415 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:44:08,415 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-18 21:44:08,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 21:44:08,616 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-18 21:44:08,616 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-18 21:44:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:44:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash 421565270, now seen corresponding path program 1 times [2023-02-18 21:44:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:44:08,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219749963] [2023-02-18 21:44:08,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:44:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:44:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:44:08,813 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-18 21:44:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:44:08,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219749963] [2023-02-18 21:44:08,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219749963] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:44:08,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:44:08,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-18 21:44:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827445782] [2023-02-18 21:44:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:44:08,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 21:44:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:44:08,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 21:44:08,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-18 21:44:08,815 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-18 21:44:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:44:09,111 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2023-02-18 21:44:09,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 21:44:09,111 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-18 21:44:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:44:09,112 INFO L225 Difference]: With dead ends: 202 [2023-02-18 21:44:09,112 INFO L226 Difference]: Without dead ends: 202 [2023-02-18 21:44:09,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2023-02-18 21:44:09,112 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 215 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:44:09,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 348 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 21:44:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-18 21:44:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2023-02-18 21:44:09,114 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-18 21:44:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2023-02-18 21:44:09,115 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 38 [2023-02-18 21:44:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:44:09,115 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2023-02-18 21:44:09,115 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-18 21:44:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2023-02-18 21:44:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 21:44:09,116 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:44:09,116 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-18 21:44:09,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-18 21:44:09,117 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-18 21:44:09,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:44:09,117 INFO L85 PathProgramCache]: Analyzing trace with hash 183621750, now seen corresponding path program 1 times [2023-02-18 21:44:09,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:44:09,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878691943] [2023-02-18 21:44:09,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:44:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:44:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:44:09,311 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-18 21:44:09,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:44:09,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878691943] [2023-02-18 21:44:09,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878691943] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:44:09,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:44:09,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-18 21:44:09,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042262861] [2023-02-18 21:44:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:44:09,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 21:44:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:44:09,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 21:44:09,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-18 21:44:09,313 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-18 21:44:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:44:09,698 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2023-02-18 21:44:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 21:44:09,698 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-18 21:44:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:44:09,699 INFO L225 Difference]: With dead ends: 201 [2023-02-18 21:44:09,699 INFO L226 Difference]: Without dead ends: 201 [2023-02-18 21:44:09,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2023-02-18 21:44:09,700 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 174 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 21:44:09,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 358 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 21:44:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-02-18 21:44:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 148. [2023-02-18 21:44:09,701 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-18 21:44:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2023-02-18 21:44:09,702 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 39 [2023-02-18 21:44:09,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:44:09,702 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2023-02-18 21:44:09,702 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-18 21:44:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2023-02-18 21:44:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 21:44:09,702 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:44:09,702 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-18 21:44:09,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-18 21:44:09,702 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-18 21:44:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:44:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086814, now seen corresponding path program 1 times [2023-02-18 21:44:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:44:09,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972028814] [2023-02-18 21:44:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:44:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:44:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:44:09,959 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-18 21:44:09,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:44:09,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972028814] [2023-02-18 21:44:09,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972028814] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:44:09,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539909641] [2023-02-18 21:44:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:44:09,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 21:44:09,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 21:44:09,961 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-18 21:44:09,965 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-18 21:44:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:44:10,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-18 21:44:10,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:44:10,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:10,121 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 15 [2023-02-18 21:44:10,140 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-18 21:44:10,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:10,179 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 36 [2023-02-18 21:44:10,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:10,218 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 36 [2023-02-18 21:44:10,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:10,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-02-18 21:44:10,456 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:44:10,456 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-02-18 21:44:10,468 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-18 21:44:10,469 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-18 21:44:10,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:44:10,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:10,496 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-18 21:44:10,561 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))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))) (not (<= 0 |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))) (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 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_63|) (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-02-18 21:44:10,697 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 (= |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|))) (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|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (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|))) (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-18 21:44:10,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:10,709 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-18 21:44:10,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:10,712 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 245 treesize of output 220 [2023-02-18 21:44:10,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:10,717 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 204 treesize of output 197 [2023-02-18 21:44:10,720 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 188 treesize of output 180 [2023-02-18 21:44:10,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:10,772 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 46 [2023-02-18 21:44:10,775 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:44:10,775 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:44:10,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:44:10,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:44:10,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:44:10,782 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2023-02-18 21:44:10,786 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 21:44:10,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:10,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 419 treesize of output 559 [2023-02-18 21:44:11,372 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-18 21:44:11,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539909641] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 21:44:11,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 21:44:11,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 40 [2023-02-18 21:44:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103362492] [2023-02-18 21:44:11,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 21:44:11,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-18 21:44:11,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:44:11,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-18 21:44:11,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1289, Unknown=19, NotChecked=150, Total=1640 [2023-02-18 21:44:11,374 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-18 21:44:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:44:12,487 INFO L93 Difference]: Finished difference Result 200 states and 204 transitions. [2023-02-18 21:44:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 21:44:12,488 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-18 21:44:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:44:12,494 INFO L225 Difference]: With dead ends: 200 [2023-02-18 21:44:12,494 INFO L226 Difference]: Without dead ends: 200 [2023-02-18 21:44:12,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=473, Invalid=2165, Unknown=22, NotChecked=202, Total=2862 [2023-02-18 21:44:12,496 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 591 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 21:44:12,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 962 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1637 Invalid, 0 Unknown, 272 Unchecked, 0.9s Time] [2023-02-18 21:44:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-18 21:44:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 154. [2023-02-18 21:44:12,498 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-18 21:44:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2023-02-18 21:44:12,499 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 39 [2023-02-18 21:44:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:44:12,499 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2023-02-18 21:44:12,499 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-18 21:44:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2023-02-18 21:44:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 21:44:12,499 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:44:12,499 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-18 21:44:12,508 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-18 21:44:12,705 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-18 21:44:12,705 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-18 21:44:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:44:12,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086815, now seen corresponding path program 1 times [2023-02-18 21:44:12,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:44:12,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121125544] [2023-02-18 21:44:12,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:44:12,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:44:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:44:12,838 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-18 21:44:12,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:44:12,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121125544] [2023-02-18 21:44:12,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121125544] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:44:12,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336645292] [2023-02-18 21:44:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:44:12,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 21:44:12,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 21:44:12,840 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-18 21:44:12,856 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-18 21:44:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:44:12,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 21:44:12,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:44:13,086 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:44:13,091 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 25 treesize of output 17 [2023-02-18 21:44:13,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:44:13,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:13,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-02-18 21:44:13,103 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-18 21:44:13,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:44:13,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:13,118 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 36 treesize of output 40 [2023-02-18 21:44:13,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:13,159 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 36 treesize of output 40 [2023-02-18 21:44:13,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:13,165 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 39 treesize of output 34 [2023-02-18 21:44:13,201 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-18 21:44:13,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336645292] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 21:44:13,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 21:44:13,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-02-18 21:44:13,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402932630] [2023-02-18 21:44:13,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 21:44:13,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 21:44:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:44:13,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 21:44:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-02-18 21:44:13,203 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-18 21:44:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:44:13,822 INFO L93 Difference]: Finished difference Result 220 states and 225 transitions. [2023-02-18 21:44:13,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 21:44:13,822 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-18 21:44:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:44:13,823 INFO L225 Difference]: With dead ends: 220 [2023-02-18 21:44:13,823 INFO L226 Difference]: Without dead ends: 220 [2023-02-18 21:44:13,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2023-02-18 21:44:13,824 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 467 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 21:44:13,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 462 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 21:44:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-18 21:44:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 164. [2023-02-18 21:44:13,826 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-18 21:44:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2023-02-18 21:44:13,826 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 39 [2023-02-18 21:44:13,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:44:13,827 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2023-02-18 21:44:13,827 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-18 21:44:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2023-02-18 21:44:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-18 21:44:13,827 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:44:13,827 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-18 21:44:13,849 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-18 21:44:14,027 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-18 21:44:14,028 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-18 21:44:14,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:44:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1397307224, now seen corresponding path program 1 times [2023-02-18 21:44:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:44:14,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13122947] [2023-02-18 21:44:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:44:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:44:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:44:14,116 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-18 21:44:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:44:14,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13122947] [2023-02-18 21:44:14,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13122947] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:44:14,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:44:14,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 21:44:14,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89954301] [2023-02-18 21:44:14,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:44:14,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 21:44:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 21:44:14,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 21:44:14,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 21:44:14,118 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-18 21:44:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:44:14,336 INFO L93 Difference]: Finished difference Result 192 states and 199 transitions. [2023-02-18 21:44:14,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 21:44:14,337 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-18 21:44:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:44:14,337 INFO L225 Difference]: With dead ends: 192 [2023-02-18 21:44:14,337 INFO L226 Difference]: Without dead ends: 192 [2023-02-18 21:44:14,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-18 21:44:14,338 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-18 21:44:14,338 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-18 21:44:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-18 21:44:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2023-02-18 21:44:14,340 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-18 21:44:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2023-02-18 21:44:14,340 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 40 [2023-02-18 21:44:14,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:44:14,341 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2023-02-18 21:44:14,341 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-18 21:44:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2023-02-18 21:44:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-18 21:44:14,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:44:14,341 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-18 21:44:14,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-18 21:44:14,341 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-18 21:44:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:44:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 402357860, now seen corresponding path program 1 times [2023-02-18 21:44:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 21:44:14,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427447086] [2023-02-18 21:44:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:44:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 21:44:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:44:14,760 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-18 21:44:14,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 21:44:14,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427447086] [2023-02-18 21:44:14,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427447086] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:44:14,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075687360] [2023-02-18 21:44:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:44:14,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 21:44:14,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 21:44:14,761 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-18 21:44:14,763 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-18 21:44:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:44:14,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-18 21:44:14,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:44:14,888 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-18 21:44:14,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:14,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 21:44:14,945 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-18 21:44:14,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:14,992 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 36 [2023-02-18 21:44:14,997 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 28 treesize of output 20 [2023-02-18 21:44:15,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,067 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 36 [2023-02-18 21:44:15,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-02-18 21:44:15,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,103 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 62 [2023-02-18 21:44:15,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-02-18 21:44:15,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:44:15,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,137 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 26 [2023-02-18 21:44:15,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 68 [2023-02-18 21:44:15,167 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 21:44:15,170 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 21:44:15,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-02-18 21:44:15,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 60 [2023-02-18 21:44:15,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 301 treesize of output 287 [2023-02-18 21:44:15,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 63 treesize of output 111 [2023-02-18 21:44:15,314 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 21:44:15,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:44:15,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2023-02-18 21:44:15,335 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 21:44:15,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,341 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 42 treesize of output 58 [2023-02-18 21:44:15,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,378 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 474 treesize of output 392 [2023-02-18 21:44:15,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 391 treesize of output 301 [2023-02-18 21:44:15,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,623 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 169 treesize of output 195 [2023-02-18 21:44:15,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,664 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 69 [2023-02-18 21:44:15,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,671 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 61 [2023-02-18 21:44:15,677 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 60 treesize of output 44 [2023-02-18 21:44:15,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 152 [2023-02-18 21:44:15,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:44:15,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 44 case distinctions, treesize of input 355 treesize of output 1556