./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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/list-ext-properties/list-ext_flag_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 9e6ddc72db9996307e31b37c1f23ddad101cfdc849bb3a24fd3b76db809c7055 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:53:18,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:53:18,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:53:18,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:53:18,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:53:18,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:53:18,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:53:18,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:53:18,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:53:18,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:53:18,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:53:18,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:53:18,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:53:18,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:53:18,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:53:18,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:53:18,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:53:18,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:53:18,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:53:18,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:53:18,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:53:18,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:53:18,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:53:18,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:53:18,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:53:18,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:53:18,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:53:18,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:53:18,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:53:18,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:53:18,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:53:18,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:53:18,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:53:18,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:53:18,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:53:18,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:53:18,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:53:18,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:53:18,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:53:18,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:53:18,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:53:18,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 01:53:18,268 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:53:18,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:53:18,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:53:18,269 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:53:18,270 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:53:18,270 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:53:18,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:53:18,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:53:18,271 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:53:18,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:53:18,272 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:53:18,272 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:53:18,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:53:18,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:53:18,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:53:18,273 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:53:18,273 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:53:18,273 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:53:18,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:53:18,274 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:53:18,274 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:53:18,274 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:53:18,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:53:18,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:53:18,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:53:18,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:53:18,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:53:18,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:53:18,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 01:53:18,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 01:53:18,276 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:53:18,276 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:53:18,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:53:18,276 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:53:18,277 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 -> 9e6ddc72db9996307e31b37c1f23ddad101cfdc849bb3a24fd3b76db809c7055 [2023-02-14 01:53:18,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:53:18,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:53:18,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:53:18,492 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:53:18,493 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:53:18,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i [2023-02-14 01:53:19,528 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:53:19,791 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:53:19,793 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i [2023-02-14 01:53:19,802 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5915307/05642d0d3b0244ffb771c629ec0d32bf/FLAGcdc423ea4 [2023-02-14 01:53:19,812 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5915307/05642d0d3b0244ffb771c629ec0d32bf [2023-02-14 01:53:19,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:53:19,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:53:19,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:53:19,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:53:19,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:53:19,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:53:19" (1/1) ... [2023-02-14 01:53:19,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:19, skipping insertion in model container [2023-02-14 01:53:19,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:53:19" (1/1) ... [2023-02-14 01:53:19,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:53:19,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:53:20,063 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/list-ext-properties/list-ext_flag_1.i[23654,23667] [2023-02-14 01:53:20,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:53:20,071 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 01:53:20,100 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/list-ext-properties/list-ext_flag_1.i[23654,23667] [2023-02-14 01:53:20,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:53:20,118 INFO L208 MainTranslator]: Completed translation [2023-02-14 01:53:20,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20 WrapperNode [2023-02-14 01:53:20,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:53:20,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 01:53:20,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 01:53:20,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 01:53:20,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,147 INFO L138 Inliner]: procedures = 124, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 113 [2023-02-14 01:53:20,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 01:53:20,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 01:53:20,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 01:53:20,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 01:53:20,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,174 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 01:53:20,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 01:53:20,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 01:53:20,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 01:53:20,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (1/1) ... [2023-02-14 01:53:20,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:53:20,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:53:20,217 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-14 01:53:20,233 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-14 01:53:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-14 01:53:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-14 01:53:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 01:53:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 01:53:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 01:53:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 01:53:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 01:53:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 01:53:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 01:53:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 01:53:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 01:53:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 01:53:20,326 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 01:53:20,328 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 01:53:20,345 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-14 01:53:20,614 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 01:53:20,635 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 01:53:20,635 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-14 01:53:20,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:53:20 BoogieIcfgContainer [2023-02-14 01:53:20,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 01:53:20,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 01:53:20,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 01:53:20,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 01:53:20,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:53:19" (1/3) ... [2023-02-14 01:53:20,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78336697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:53:20, skipping insertion in model container [2023-02-14 01:53:20,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:20" (2/3) ... [2023-02-14 01:53:20,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78336697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:53:20, skipping insertion in model container [2023-02-14 01:53:20,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:53:20" (3/3) ... [2023-02-14 01:53:20,643 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_flag_1.i [2023-02-14 01:53:20,655 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 01:53:20,655 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2023-02-14 01:53:20,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 01:53:20,689 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;@285ce9a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 01:53:20,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2023-02-14 01:53:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 48 states have (on average 2.125) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 01:53:20,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:20,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 01:53:20,701 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:20,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517928, now seen corresponding path program 1 times [2023-02-14 01:53:20,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:20,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570726592] [2023-02-14 01:53:20,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:20,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:20,823 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-14 01:53:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:20,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570726592] [2023-02-14 01:53:20,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570726592] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:20,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:20,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:53:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865709273] [2023-02-14 01:53:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:20,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 01:53:20,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:20,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 01:53:20,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 01:53:20,864 INFO L87 Difference]: Start difference. First operand has 91 states, 48 states have (on average 2.125) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:20,885 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-02-14 01:53:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 01:53:20,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-02-14 01:53:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:20,895 INFO L225 Difference]: With dead ends: 91 [2023-02-14 01:53:20,896 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 01:53:20,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 01:53:20,901 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:20,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:53:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 01:53:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-14 01:53:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-02-14 01:53:20,932 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 6 [2023-02-14 01:53:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:20,932 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-02-14 01:53:20,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-02-14 01:53:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-14 01:53:20,933 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:20,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:20,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 01:53:20,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:20,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:20,935 INFO L85 PathProgramCache]: Analyzing trace with hash 620871761, now seen corresponding path program 1 times [2023-02-14 01:53:20,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:20,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429995978] [2023-02-14 01:53:20,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:20,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:21,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:21,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429995978] [2023-02-14 01:53:21,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429995978] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:21,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:21,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:53:21,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731667678] [2023-02-14 01:53:21,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:21,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:53:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:21,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:53:21,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:53:21,075 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:21,211 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2023-02-14 01:53:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:53:21,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-02-14 01:53:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:21,213 INFO L225 Difference]: With dead ends: 96 [2023-02-14 01:53:21,213 INFO L226 Difference]: Without dead ends: 96 [2023-02-14 01:53:21,217 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-14 01:53:21,218 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 153 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:21,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 45 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:53:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-14 01:53:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2023-02-14 01:53:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.75) internal successors, (91), 77 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2023-02-14 01:53:21,227 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 8 [2023-02-14 01:53:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:21,227 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2023-02-14 01:53:21,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2023-02-14 01:53:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-14 01:53:21,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:21,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:21,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 01:53:21,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash 620871762, now seen corresponding path program 1 times [2023-02-14 01:53:21,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:21,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158623792] [2023-02-14 01:53:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:21,353 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-14 01:53:21,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:21,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158623792] [2023-02-14 01:53:21,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158623792] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:21,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:21,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:53:21,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023301057] [2023-02-14 01:53:21,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:21,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:53:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:21,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:53:21,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:53:21,356 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:21,491 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2023-02-14 01:53:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:53:21,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-02-14 01:53:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:21,494 INFO L225 Difference]: With dead ends: 116 [2023-02-14 01:53:21,495 INFO L226 Difference]: Without dead ends: 116 [2023-02-14 01:53:21,497 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-14 01:53:21,500 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 168 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:21,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 56 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:53:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-14 01:53:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2023-02-14 01:53:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 101 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2023-02-14 01:53:21,515 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 8 [2023-02-14 01:53:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:21,515 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2023-02-14 01:53:21,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2023-02-14 01:53:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 01:53:21,516 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:21,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:21,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 01:53:21,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:21,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash 623916195, now seen corresponding path program 1 times [2023-02-14 01:53:21,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:21,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038307977] [2023-02-14 01:53:21,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:21,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:21,616 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-14 01:53:21,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:21,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038307977] [2023-02-14 01:53:21,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038307977] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:21,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:21,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:53:21,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218649888] [2023-02-14 01:53:21,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:21,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:53:21,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:21,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:53:21,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:53:21,621 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:21,733 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2023-02-14 01:53:21,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:53:21,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-14 01:53:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:21,734 INFO L225 Difference]: With dead ends: 132 [2023-02-14 01:53:21,734 INFO L226 Difference]: Without dead ends: 132 [2023-02-14 01:53:21,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:53:21,741 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 39 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:21,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 209 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:53:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-14 01:53:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2023-02-14 01:53:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2023-02-14 01:53:21,754 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 15 [2023-02-14 01:53:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:21,754 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2023-02-14 01:53:21,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2023-02-14 01:53:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:53:21,755 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:21,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:21,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 01:53:21,756 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1684958094, now seen corresponding path program 1 times [2023-02-14 01:53:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:21,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496142625] [2023-02-14 01:53:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:21,913 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-14 01:53:21,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:21,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496142625] [2023-02-14 01:53:21,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496142625] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:21,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:21,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:53:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015573066] [2023-02-14 01:53:21,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:21,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:53:21,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:21,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:53:21,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:53:21,915 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-14 01:53:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:22,055 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2023-02-14 01:53:22,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:53:22,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-14 01:53:22,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:22,057 INFO L225 Difference]: With dead ends: 153 [2023-02-14 01:53:22,057 INFO L226 Difference]: Without dead ends: 153 [2023-02-14 01:53:22,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:53:22,060 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 112 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:22,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 199 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:53:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-14 01:53:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 106. [2023-02-14 01:53:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.5125) internal successors, (121), 105 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2023-02-14 01:53:22,072 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 17 [2023-02-14 01:53:22,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:22,073 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2023-02-14 01:53:22,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-14 01:53:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2023-02-14 01:53:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 01:53:22,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:22,076 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-14 01:53:22,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 01:53:22,077 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:22,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:22,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1529942363, now seen corresponding path program 1 times [2023-02-14 01:53:22,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:22,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809938897] [2023-02-14 01:53:22,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:22,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:22,133 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-14 01:53:22,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:22,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809938897] [2023-02-14 01:53:22,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809938897] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:22,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:22,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:53:22,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964869325] [2023-02-14 01:53:22,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:22,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:53:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:22,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:53:22,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:53:22,134 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-14 01:53:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:22,240 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2023-02-14 01:53:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:53:22,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-14 01:53:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:22,241 INFO L225 Difference]: With dead ends: 112 [2023-02-14 01:53:22,241 INFO L226 Difference]: Without dead ends: 112 [2023-02-14 01:53:22,242 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-14 01:53:22,242 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 143 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:22,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 77 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:53:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-14 01:53:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2023-02-14 01:53:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5) internal successors, (123), 107 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2023-02-14 01:53:22,245 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 18 [2023-02-14 01:53:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:22,245 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2023-02-14 01:53:22,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-14 01:53:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2023-02-14 01:53:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-14 01:53:22,246 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:22,246 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-14 01:53:22,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 01:53:22,246 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:22,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1395789589, now seen corresponding path program 1 times [2023-02-14 01:53:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:22,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845514869] [2023-02-14 01:53:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:22,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:22,322 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-14 01:53:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:22,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845514869] [2023-02-14 01:53:22,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845514869] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:22,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:22,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:53:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931986976] [2023-02-14 01:53:22,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:22,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:53:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:22,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:53:22,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:53:22,324 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-14 01:53:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:22,426 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2023-02-14 01:53:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:53:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-14 01:53:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:22,428 INFO L225 Difference]: With dead ends: 138 [2023-02-14 01:53:22,428 INFO L226 Difference]: Without dead ends: 134 [2023-02-14 01:53:22,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:53:22,429 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 73 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:22,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 185 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:53:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-14 01:53:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2023-02-14 01:53:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 111 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-14 01:53:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2023-02-14 01:53:22,432 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 20 [2023-02-14 01:53:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:22,432 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2023-02-14 01:53:22,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-14 01:53:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2023-02-14 01:53:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 01:53:22,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:22,433 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:22,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 01:53:22,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1499534887, now seen corresponding path program 1 times [2023-02-14 01:53:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:22,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764210518] [2023-02-14 01:53:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:22,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:22,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:22,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764210518] [2023-02-14 01:53:22,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764210518] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:22,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:22,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:53:22,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102955828] [2023-02-14 01:53:22,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:22,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:53:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:53:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:53:22,516 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:22,645 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2023-02-14 01:53:22,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:53:22,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 01:53:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:22,648 INFO L225 Difference]: With dead ends: 113 [2023-02-14 01:53:22,648 INFO L226 Difference]: Without dead ends: 113 [2023-02-14 01:53:22,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:53:22,650 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 112 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:22,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 162 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:53:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-14 01:53:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2023-02-14 01:53:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 109 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2023-02-14 01:53:22,653 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 21 [2023-02-14 01:53:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:22,653 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2023-02-14 01:53:22,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2023-02-14 01:53:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 01:53:22,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:22,656 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:22,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 01:53:22,656 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:22,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1499534886, now seen corresponding path program 1 times [2023-02-14 01:53:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:22,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621423883] [2023-02-14 01:53:22,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:22,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:22,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:22,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621423883] [2023-02-14 01:53:22,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621423883] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:22,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:22,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:53:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572293037] [2023-02-14 01:53:22,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:22,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:53:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:22,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:53:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:53:22,841 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:23,047 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2023-02-14 01:53:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:53:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 01:53:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:23,048 INFO L225 Difference]: With dead ends: 108 [2023-02-14 01:53:23,048 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 01:53:23,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:53:23,050 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 66 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:23,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 219 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:53:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 01:53:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2023-02-14 01:53:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.394736842105263) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2023-02-14 01:53:23,052 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 21 [2023-02-14 01:53:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:23,053 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2023-02-14 01:53:23,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2023-02-14 01:53:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 01:53:23,054 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:23,054 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] [2023-02-14 01:53:23,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 01:53:23,054 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash 37796891, now seen corresponding path program 1 times [2023-02-14 01:53:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:23,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439015279] [2023-02-14 01:53:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:23,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439015279] [2023-02-14 01:53:23,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439015279] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:23,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:23,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:53:23,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941554808] [2023-02-14 01:53:23,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:23,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:53:23,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:23,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:53:23,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:53:23,210 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:23,350 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2023-02-14 01:53:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:53:23,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-14 01:53:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:23,351 INFO L225 Difference]: With dead ends: 110 [2023-02-14 01:53:23,351 INFO L226 Difference]: Without dead ends: 101 [2023-02-14 01:53:23,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:53:23,352 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 115 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:23,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 161 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:53:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-14 01:53:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2023-02-14 01:53:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 82 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2023-02-14 01:53:23,354 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 22 [2023-02-14 01:53:23,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:23,355 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2023-02-14 01:53:23,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2023-02-14 01:53:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 01:53:23,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:23,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:23,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 01:53:23,356 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 615949290, now seen corresponding path program 1 times [2023-02-14 01:53:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741234988] [2023-02-14 01:53:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:23,727 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-14 01:53:23,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:23,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741234988] [2023-02-14 01:53:23,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741234988] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:23,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867561645] [2023-02-14 01:53:23,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:23,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:23,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:53:23,731 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-14 01:53:23,737 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-14 01:53:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:23,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-14 01:53:23,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:23,863 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-14 01:53:23,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:23,901 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 22 treesize of output 21 [2023-02-14 01:53:23,938 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:53:23,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:53:23,983 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 13 treesize of output 9 [2023-02-14 01:53:23,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:23,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:23,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-02-14 01:53:24,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 01:53:24,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-02-14 01:53:24,097 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 22 treesize of output 22 [2023-02-14 01:53:24,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:24,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2023-02-14 01:53:24,149 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-14 01:53:24,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:24,204 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2023-02-14 01:53:24,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2023-02-14 01:53:24,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:24,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2023-02-14 01:53:24,405 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-02-14 01:53:24,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2023-02-14 01:53:24,410 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 22 treesize of output 18 [2023-02-14 01:53:24,416 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 01:53:24,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-14 01:53:24,480 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-14 01:53:24,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867561645] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:24,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:53:24,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 33 [2023-02-14 01:53:24,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639268073] [2023-02-14 01:53:24,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:24,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-14 01:53:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-14 01:53:24,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=761, Unknown=5, NotChecked=118, Total=1056 [2023-02-14 01:53:24,483 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:25,213 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2023-02-14 01:53:25,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 01:53:25,213 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-14 01:53:25,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:25,214 INFO L225 Difference]: With dead ends: 195 [2023-02-14 01:53:25,214 INFO L226 Difference]: Without dead ends: 195 [2023-02-14 01:53:25,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1212, Unknown=6, NotChecked=154, Total=1722 [2023-02-14 01:53:25,215 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 471 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 58 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:25,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 455 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 719 Invalid, 4 Unknown, 394 Unchecked, 0.5s Time] [2023-02-14 01:53:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-02-14 01:53:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 103. [2023-02-14 01:53:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 102 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2023-02-14 01:53:25,217 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 30 [2023-02-14 01:53:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:25,217 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2023-02-14 01:53:25,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2023-02-14 01:53:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 01:53:25,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:25,218 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:25,225 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-14 01:53:25,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-14 01:53:25,425 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash 615641460, now seen corresponding path program 1 times [2023-02-14 01:53:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:25,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3085448] [2023-02-14 01:53:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:25,666 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-14 01:53:25,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:25,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3085448] [2023-02-14 01:53:25,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3085448] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:25,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932439189] [2023-02-14 01:53:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:25,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:25,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:53:25,685 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-14 01:53:25,714 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-14 01:53:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:25,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-14 01:53:25,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:25,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:53:25,917 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:53:25,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:53:25,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:25,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:53:25,956 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 13 treesize of output 9 [2023-02-14 01:53:25,984 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 20 treesize of output 8 [2023-02-14 01:53:26,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:53:26,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:53:26,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:53:26,085 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-14 01:53:26,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:26,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:26,220 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 23 treesize of output 29 [2023-02-14 01:53:26,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:26,237 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 33 [2023-02-14 01:53:26,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-14 01:53:26,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:26,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-14 01:53:26,419 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-14 01:53:26,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932439189] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:26,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:53:26,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2023-02-14 01:53:26,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415268462] [2023-02-14 01:53:26,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:26,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-14 01:53:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:26,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 01:53:26,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=662, Unknown=13, NotChecked=0, Total=812 [2023-02-14 01:53:26,422 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:27,154 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2023-02-14 01:53:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 01:53:27,155 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 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-14 01:53:27,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:27,156 INFO L225 Difference]: With dead ends: 202 [2023-02-14 01:53:27,156 INFO L226 Difference]: Without dead ends: 202 [2023-02-14 01:53:27,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=1047, Unknown=13, NotChecked=0, Total=1332 [2023-02-14 01:53:27,156 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 356 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 56 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:27,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 668 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 864 Invalid, 4 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:53:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-14 01:53:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 105. [2023-02-14 01:53:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 104 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2023-02-14 01:53:27,159 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 30 [2023-02-14 01:53:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:27,159 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2023-02-14 01:53:27,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2023-02-14 01:53:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 01:53:27,159 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:27,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:27,170 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-14 01:53:27,368 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,SelfDestructingSolverStorable11 [2023-02-14 01:53:27,368 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:27,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1355563894, now seen corresponding path program 1 times [2023-02-14 01:53:27,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:27,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189429315] [2023-02-14 01:53:27,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:27,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:27,606 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-14 01:53:27,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:27,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189429315] [2023-02-14 01:53:27,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189429315] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:27,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16650470] [2023-02-14 01:53:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:27,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:27,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:53:27,608 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-14 01:53:27,657 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-14 01:53:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:27,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-14 01:53:27,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:27,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:53:27,817 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:53:27,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:53:27,847 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 13 treesize of output 9 [2023-02-14 01:53:27,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:27,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 21 treesize of output 20 [2023-02-14 01:53:27,904 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 20 treesize of output 8 [2023-02-14 01:53:27,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:53:27,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:53:28,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:53:28,010 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-14 01:53:28,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:28,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:28,167 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 23 treesize of output 29 [2023-02-14 01:53:28,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:28,174 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 33 [2023-02-14 01:53:28,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-14 01:53:28,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:28,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-14 01:53:28,421 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-14 01:53:28,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16650470] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:28,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:53:28,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2023-02-14 01:53:28,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405611864] [2023-02-14 01:53:28,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:28,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-14 01:53:28,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:28,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 01:53:28,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=666, Unknown=9, NotChecked=0, Total=812 [2023-02-14 01:53:28,423 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:29,391 INFO L93 Difference]: Finished difference Result 218 states and 244 transitions. [2023-02-14 01:53:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 01:53:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 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-14 01:53:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:29,393 INFO L225 Difference]: With dead ends: 218 [2023-02-14 01:53:29,393 INFO L226 Difference]: Without dead ends: 218 [2023-02-14 01:53:29,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=1050, Unknown=10, NotChecked=0, Total=1332 [2023-02-14 01:53:29,394 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 387 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 31 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:29,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 960 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1477 Invalid, 5 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:53:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-14 01:53:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 123. [2023-02-14 01:53:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 122 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-14 01:53:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2023-02-14 01:53:29,396 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 30 [2023-02-14 01:53:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:29,396 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2023-02-14 01:53:29,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2023-02-14 01:53:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 01:53:29,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:29,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:29,403 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-14 01:53:29,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:29,597 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:29,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:29,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1355871724, now seen corresponding path program 1 times [2023-02-14 01:53:29,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:29,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408664190] [2023-02-14 01:53:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:30,012 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-14 01:53:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:30,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408664190] [2023-02-14 01:53:30,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408664190] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:30,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035396022] [2023-02-14 01:53:30,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:30,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:30,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:53:30,015 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-14 01:53:30,017 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-14 01:53:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:30,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 01:53:30,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:30,128 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-14 01:53:30,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:30,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:53:30,172 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:53:30,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:53:30,191 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 13 treesize of output 9 [2023-02-14 01:53:30,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-14 01:53:30,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 01:53:30,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:53:30,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:53:30,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:53:30,255 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-14 01:53:30,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:30,277 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2023-02-14 01:53:30,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:30,547 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2023-02-14 01:53:30,555 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-02-14 01:53:30,555 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 31 [2023-02-14 01:53:30,558 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-14 01:53:30,563 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 01:53:30,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-14 01:53:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-14 01:53:30,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035396022] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:30,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:53:30,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2023-02-14 01:53:30,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965647572] [2023-02-14 01:53:30,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:30,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 01:53:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:30,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 01:53:30,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=487, Unknown=14, NotChecked=46, Total=650 [2023-02-14 01:53:30,602 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:31,298 INFO L93 Difference]: Finished difference Result 191 states and 214 transitions. [2023-02-14 01:53:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 01:53:31,299 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 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-14 01:53:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:31,300 INFO L225 Difference]: With dead ends: 191 [2023-02-14 01:53:31,300 INFO L226 Difference]: Without dead ends: 191 [2023-02-14 01:53:31,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=761, Unknown=16, NotChecked=60, Total=1056 [2023-02-14 01:53:31,300 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 326 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 33 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:31,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 730 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1027 Invalid, 9 Unknown, 174 Unchecked, 0.5s Time] [2023-02-14 01:53:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-14 01:53:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 123. [2023-02-14 01:53:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 122 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2023-02-14 01:53:31,303 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 30 [2023-02-14 01:53:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:31,303 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2023-02-14 01:53:31,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2023-02-14 01:53:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:53:31,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:31,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:31,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:31,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:31,509 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025696, now seen corresponding path program 1 times [2023-02-14 01:53:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:31,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570304577] [2023-02-14 01:53:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:31,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:31,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:31,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570304577] [2023-02-14 01:53:31,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570304577] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:31,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566865372] [2023-02-14 01:53:31,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:31,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:31,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:53:31,791 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:53:31,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 01:53:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:31,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-14 01:53:31,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:31,955 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 01:53:31,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 01:53:31,993 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 13 treesize of output 9 [2023-02-14 01:53:32,095 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:32,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-14 01:53:32,111 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:32,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 01:53:32,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 01:53:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:32,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:32,279 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2023-02-14 01:53:32,307 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_503) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2023-02-14 01:53:32,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:32,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-02-14 01:53:32,317 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:32,317 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 40 treesize of output 39 [2023-02-14 01:53:32,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-14 01:53:36,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:36,616 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 74 treesize of output 228 [2023-02-14 01:53:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-14 01:53:37,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566865372] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:37,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:53:37,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2023-02-14 01:53:37,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377037868] [2023-02-14 01:53:37,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:37,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-14 01:53:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-14 01:53:37,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=760, Unknown=6, NotChecked=118, Total=1056 [2023-02-14 01:53:37,755 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:38,327 INFO L93 Difference]: Finished difference Result 211 states and 238 transitions. [2023-02-14 01:53:38,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 01:53:38,328 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-14 01:53:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:38,328 INFO L225 Difference]: With dead ends: 211 [2023-02-14 01:53:38,328 INFO L226 Difference]: Without dead ends: 211 [2023-02-14 01:53:38,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=312, Invalid=1172, Unknown=6, NotChecked=150, Total=1640 [2023-02-14 01:53:38,329 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 440 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:38,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 578 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 928 Invalid, 0 Unknown, 334 Unchecked, 0.4s Time] [2023-02-14 01:53:38,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-14 01:53:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 126. [2023-02-14 01:53:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 125 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-14 01:53:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2023-02-14 01:53:38,331 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 32 [2023-02-14 01:53:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:38,332 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2023-02-14 01:53:38,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2023-02-14 01:53:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:53:38,332 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:38,333 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:38,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:38,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 01:53:38,538 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025695, now seen corresponding path program 1 times [2023-02-14 01:53:38,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:38,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608741809] [2023-02-14 01:53:38,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:38,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:38,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608741809] [2023-02-14 01:53:38,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608741809] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:38,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302052450] [2023-02-14 01:53:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:38,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:38,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:53:38,969 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:53:38,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 01:53:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:39,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-14 01:53:39,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:39,127 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-14 01:53:39,134 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:53:39,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:53:39,153 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 13 treesize of output 9 [2023-02-14 01:53:39,159 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-14 01:53:39,239 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:53:39,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 01:53:39,251 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:39,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-14 01:53:39,279 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:39,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-14 01:53:39,283 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 18 treesize of output 20 [2023-02-14 01:53:39,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 01:53:39,368 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 15 treesize of output 7 [2023-02-14 01:53:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:39,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:39,514 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_580 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2023-02-14 01:53:39,526 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_580 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_579) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2023-02-14 01:53:39,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:39,532 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 22 treesize of output 23 [2023-02-14 01:53:39,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:39,537 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 35 [2023-02-14 01:53:39,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 01:53:39,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:39,554 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 45 treesize of output 46 [2023-02-14 01:53:39,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:39,559 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 1 case distinctions, treesize of input 35 treesize of output 36 [2023-02-14 01:53:39,561 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:53:39,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:39,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-14 01:53:39,564 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:53:39,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:39,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-14 01:53:39,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:39,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-14 01:53:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:39,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302052450] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:39,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:53:39,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 26 [2023-02-14 01:53:39,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638775232] [2023-02-14 01:53:39,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:39,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-14 01:53:39,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:39,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-14 01:53:39,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=497, Unknown=12, NotChecked=94, Total=702 [2023-02-14 01:53:39,727 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 27 states, 26 states have (on average 3.0) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:42,619 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2023-02-14 01:53:42,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 01:53:42,619 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.0) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-14 01:53:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:42,620 INFO L225 Difference]: With dead ends: 212 [2023-02-14 01:53:42,620 INFO L226 Difference]: Without dead ends: 212 [2023-02-14 01:53:42,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=320, Invalid=1156, Unknown=14, NotChecked=150, Total=1640 [2023-02-14 01:53:42,621 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 494 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:42,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 520 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 702 Invalid, 0 Unknown, 288 Unchecked, 0.4s Time] [2023-02-14 01:53:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-14 01:53:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 124. [2023-02-14 01:53:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 123 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-14 01:53:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2023-02-14 01:53:42,623 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 32 [2023-02-14 01:53:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:42,623 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2023-02-14 01:53:42,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.0) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2023-02-14 01:53:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 01:53:42,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:42,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:42,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:42,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-14 01:53:42,830 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:42,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1553010291, now seen corresponding path program 1 times [2023-02-14 01:53:42,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:42,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682765350] [2023-02-14 01:53:42,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:43,102 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-14 01:53:43,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:43,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682765350] [2023-02-14 01:53:43,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682765350] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:43,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093623909] [2023-02-14 01:53:43,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:43,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:43,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:53:43,109 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:53:43,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 01:53:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:43,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 01:53:43,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:43,259 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:53:43,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:53:43,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:53:43,364 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:43,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2023-02-14 01:53:43,377 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:43,377 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 27 treesize of output 28 [2023-02-14 01:53:43,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:43,426 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 26 treesize of output 20 [2023-02-14 01:53:43,458 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-14 01:53:43,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:43,533 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2023-02-14 01:53:43,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:43,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2023-02-14 01:53:43,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:43,578 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 35 treesize of output 36 [2023-02-14 01:53:43,582 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 20 treesize of output 18 [2023-02-14 01:53:43,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:43,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2023-02-14 01:53:43,752 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-14 01:53:43,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093623909] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:43,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:53:43,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 29 [2023-02-14 01:53:43,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728979277] [2023-02-14 01:53:43,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:43,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-14 01:53:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:43,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 01:53:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=666, Unknown=7, NotChecked=52, Total=812 [2023-02-14 01:53:43,754 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:44,744 INFO L93 Difference]: Finished difference Result 288 states and 327 transitions. [2023-02-14 01:53:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 01:53:44,744 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-14 01:53:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:44,745 INFO L225 Difference]: With dead ends: 288 [2023-02-14 01:53:44,745 INFO L226 Difference]: Without dead ends: 288 [2023-02-14 01:53:44,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=503, Invalid=2355, Unknown=8, NotChecked=104, Total=2970 [2023-02-14 01:53:44,747 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 790 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:44,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 823 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1032 Invalid, 0 Unknown, 160 Unchecked, 0.4s Time] [2023-02-14 01:53:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-02-14 01:53:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 147. [2023-02-14 01:53:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 134 states have (on average 1.335820895522388) internal successors, (179), 146 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 179 transitions. [2023-02-14 01:53:44,750 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 179 transitions. Word has length 33 [2023-02-14 01:53:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:44,750 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 179 transitions. [2023-02-14 01:53:44,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 179 transitions. [2023-02-14 01:53:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 01:53:44,751 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:44,751 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:44,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:44,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:44,957 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:53:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1319887619, now seen corresponding path program 1 times [2023-02-14 01:53:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:44,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971952943] [2023-02-14 01:53:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:44,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:53:45,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:45,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971952943] [2023-02-14 01:53:45,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971952943] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:45,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255162594] [2023-02-14 01:53:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:45,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:45,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:53:45,197 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:53:45,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 01:53:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:45,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-14 01:53:45,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:45,406 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 01:53:45,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 01:53:45,446 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 13 treesize of output 9 [2023-02-14 01:53:45,586 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:45,586 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 37 treesize of output 35 [2023-02-14 01:53:45,607 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:45,607 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 34 treesize of output 35 [2023-02-14 01:53:45,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:45,754 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 31 treesize of output 21 [2023-02-14 01:53:45,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-02-14 01:53:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:45,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:46,099 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_ArrVal_729 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1)) is different from false [2023-02-14 01:53:46,156 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_ArrVal_729 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1)) is different from false [2023-02-14 01:53:46,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:46,161 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 25 treesize of output 26 [2023-02-14 01:53:46,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:46,167 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 42 treesize of output 43 [2023-02-14 01:53:46,170 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 14 treesize of output 12 [2023-02-14 01:53:46,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:46,587 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 85 treesize of output 155 [2023-02-14 01:53:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-14 01:53:46,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255162594] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:46,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:53:46,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 39 [2023-02-14 01:53:46,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69597497] [2023-02-14 01:53:46,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:46,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-14 01:53:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:46,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-14 01:53:46,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1181, Unknown=9, NotChecked=142, Total=1482 [2023-02-14 01:53:46,795 INFO L87 Difference]: Start difference. First operand 147 states and 179 transitions. Second operand has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:18,267 INFO L93 Difference]: Finished difference Result 305 states and 345 transitions. [2023-02-14 01:54:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-02-14 01:54:18,267 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-14 01:54:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:18,268 INFO L225 Difference]: With dead ends: 305 [2023-02-14 01:54:18,268 INFO L226 Difference]: Without dead ends: 305 [2023-02-14 01:54:18,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=1291, Invalid=6701, Unknown=26, NotChecked=354, Total=8372 [2023-02-14 01:54:18,271 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 733 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 90 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:18,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1001 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1752 Invalid, 1 Unknown, 323 Unchecked, 1.1s Time] [2023-02-14 01:54:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-02-14 01:54:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 151. [2023-02-14 01:54:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 138 states have (on average 1.326086956521739) internal successors, (183), 150 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 183 transitions. [2023-02-14 01:54:18,275 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 183 transitions. Word has length 35 [2023-02-14 01:54:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:18,276 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 183 transitions. [2023-02-14 01:54:18,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 183 transitions. [2023-02-14 01:54:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 01:54:18,276 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:18,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:54:18,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:18,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-14 01:54:18,484 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:54:18,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1240762011, now seen corresponding path program 1 times [2023-02-14 01:54:18,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:54:18,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100731130] [2023-02-14 01:54:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:18,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:54:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 01:54:18,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:54:18,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100731130] [2023-02-14 01:54:18,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100731130] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:18,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984114268] [2023-02-14 01:54:18,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:18,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:54:18,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:54:18,558 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:54:18,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 01:54:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:18,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:54:18,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:18,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:54:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 01:54:18,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 01:54:18,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984114268] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:54:18,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:54:18,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-14 01:54:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501236651] [2023-02-14 01:54:18,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:54:18,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 01:54:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:54:18,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 01:54:18,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:54:18,755 INFO L87 Difference]: Start difference. First operand 151 states and 183 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:19,020 INFO L93 Difference]: Finished difference Result 366 states and 433 transitions. [2023-02-14 01:54:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:54:19,020 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 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-14 01:54:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:19,021 INFO L225 Difference]: With dead ends: 366 [2023-02-14 01:54:19,022 INFO L226 Difference]: Without dead ends: 366 [2023-02-14 01:54:19,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2023-02-14 01:54:19,022 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 336 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:19,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 470 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:54:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-02-14 01:54:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 189. [2023-02-14 01:54:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 176 states have (on average 1.4261363636363635) internal successors, (251), 188 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 251 transitions. [2023-02-14 01:54:19,027 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 251 transitions. Word has length 36 [2023-02-14 01:54:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:19,027 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 251 transitions. [2023-02-14 01:54:19,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 251 transitions. [2023-02-14 01:54:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 01:54:19,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:19,028 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:54:19,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:19,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:54:19,234 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:54:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:19,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1655615668, now seen corresponding path program 1 times [2023-02-14 01:54:19,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:54:19,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156956337] [2023-02-14 01:54:19,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:19,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:54:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:54:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156956337] [2023-02-14 01:54:19,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156956337] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951046442] [2023-02-14 01:54:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:19,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:54:19,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:54:19,601 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:54:19,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 01:54:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:19,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-14 01:54:19,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:19,806 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:54:19,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:54:19,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-14 01:54:19,847 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 13 treesize of output 9 [2023-02-14 01:54:19,853 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-14 01:54:19,972 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:54:19,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-14 01:54:19,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:54:19,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:19,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:20,027 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:54:20,027 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 78 treesize of output 71 [2023-02-14 01:54:20,062 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 41 treesize of output 36 [2023-02-14 01:54:20,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-02-14 01:54:20,202 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 40 treesize of output 24 [2023-02-14 01:54:20,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-14 01:54:20,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:54:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:20,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:20,445 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_878 Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_876) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= (+ 8 .cse0) (select |c_#length| .cse1))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_878)) .cse1) .cse0) 3))))) is different from false [2023-02-14 01:54:20,455 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 199 treesize of output 177 [2023-02-14 01:54:20,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:20,649 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 139 treesize of output 120 [2023-02-14 01:54:20,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:20,653 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 115 treesize of output 96 [2023-02-14 01:54:20,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:20,659 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 165 treesize of output 152 [2023-02-14 01:54:20,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:20,670 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 250 treesize of output 213 [2023-02-14 01:54:20,682 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 197 treesize of output 185 [2023-02-14 01:54:20,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 185 treesize of output 177 [2023-02-14 01:54:20,693 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 177 treesize of output 169 [2023-02-14 01:54:20,696 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 169 treesize of output 157 [2023-02-14 01:54:20,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:20,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-14 01:54:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:20,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951046442] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:54:20,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:54:20,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 42 [2023-02-14 01:54:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111957033] [2023-02-14 01:54:20,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:54:20,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-14 01:54:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:54:20,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-14 01:54:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1460, Unknown=1, NotChecked=78, Total=1722 [2023-02-14 01:54:20,966 INFO L87 Difference]: Start difference. First operand 189 states and 251 transitions. Second operand has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:21,999 INFO L93 Difference]: Finished difference Result 196 states and 233 transitions. [2023-02-14 01:54:22,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 01:54:22,000 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 states have internal predecessors, (101), 0 states have call successors, (0), 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-14 01:54:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:22,001 INFO L225 Difference]: With dead ends: 196 [2023-02-14 01:54:22,001 INFO L226 Difference]: Without dead ends: 196 [2023-02-14 01:54:22,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=334, Invalid=2119, Unknown=1, NotChecked=96, Total=2550 [2023-02-14 01:54:22,002 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 295 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:22,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 818 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1291 Invalid, 0 Unknown, 113 Unchecked, 0.7s Time] [2023-02-14 01:54:22,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-14 01:54:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2023-02-14 01:54:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 156 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2023-02-14 01:54:22,004 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 38 [2023-02-14 01:54:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:22,004 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2023-02-14 01:54:22,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2023-02-14 01:54:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 01:54:22,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:22,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:54:22,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-14 01:54:22,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:54:22,214 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:54:22,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1570044186, now seen corresponding path program 1 times [2023-02-14 01:54:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:54:22,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854977042] [2023-02-14 01:54:22,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:54:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:22,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:54:22,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854977042] [2023-02-14 01:54:22,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854977042] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:22,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883370443] [2023-02-14 01:54:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:22,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:54:22,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:54:22,851 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:54:22,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 01:54:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:22,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-14 01:54:22,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:23,032 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-14 01:54:23,040 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:54:23,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:54:23,079 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 13 treesize of output 9 [2023-02-14 01:54:23,088 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-14 01:54:23,220 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:54:23,221 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 37 treesize of output 35 [2023-02-14 01:54:23,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:23,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 01:54:23,250 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:54:23,250 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 46 treesize of output 45 [2023-02-14 01:54:23,254 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 22 treesize of output 24 [2023-02-14 01:54:23,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:23,488 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 31 treesize of output 21 [2023-02-14 01:54:23,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:23,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2023-02-14 01:54:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 01:54:23,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:23,903 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_958 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8))) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2023-02-14 01:54:23,925 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_958 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8)))) is different from false [2023-02-14 01:54:24,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:24,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2023-02-14 01:54:24,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:24,032 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 31 treesize of output 32 [2023-02-14 01:54:24,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:24,039 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 54 treesize of output 55 [2023-02-14 01:54:24,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:24,049 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 84 treesize of output 81 [2023-02-14 01:54:24,053 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 34 treesize of output 30 [2023-02-14 01:54:24,056 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 62 treesize of output 58 [2023-02-14 01:54:24,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:24,088 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 22 treesize of output 23 [2023-02-14 01:54:24,090 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:54:24,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:24,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-02-14 01:54:24,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:24,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-14 01:54:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2023-02-14 01:54:24,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883370443] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:54:24,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:54:24,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 46 [2023-02-14 01:54:24,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531731345] [2023-02-14 01:54:24,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:54:24,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-14 01:54:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:54:24,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-14 01:54:24,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1747, Unknown=8, NotChecked=174, Total=2162 [2023-02-14 01:54:24,325 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:25,765 INFO L93 Difference]: Finished difference Result 209 states and 247 transitions. [2023-02-14 01:54:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-14 01:54:25,766 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 0 states have call successors, (0), 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 43 [2023-02-14 01:54:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:25,766 INFO L225 Difference]: With dead ends: 209 [2023-02-14 01:54:25,766 INFO L226 Difference]: Without dead ends: 209 [2023-02-14 01:54:25,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=946, Invalid=4456, Unknown=8, NotChecked=290, Total=5700 [2023-02-14 01:54:25,768 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 896 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:25,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 629 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1162 Invalid, 0 Unknown, 248 Unchecked, 0.5s Time] [2023-02-14 01:54:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-14 01:54:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 161. [2023-02-14 01:54:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 149 states have (on average 1.3355704697986577) internal successors, (199), 160 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2023-02-14 01:54:25,770 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 43 [2023-02-14 01:54:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:25,771 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2023-02-14 01:54:25,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2023-02-14 01:54:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 01:54:25,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:25,771 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:54:25,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:25,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-14 01:54:25,996 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:54:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1048082290, now seen corresponding path program 2 times [2023-02-14 01:54:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:54:25,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028820705] [2023-02-14 01:54:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:54:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:26,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:54:26,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028820705] [2023-02-14 01:54:26,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028820705] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:26,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570532048] [2023-02-14 01:54:26,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:54:26,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:54:26,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:54:26,531 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:54:26,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-14 01:54:26,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:54:26,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:54:26,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-14 01:54:26,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:26,671 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-14 01:54:26,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:26,702 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 22 treesize of output 21 [2023-02-14 01:54:26,727 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 01:54:26,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 01:54:26,775 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 24 treesize of output 23 [2023-02-14 01:54:26,785 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 13 treesize of output 9 [2023-02-14 01:54:26,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 01:54:26,891 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 15 treesize of output 17 [2023-02-14 01:54:26,922 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 15 treesize of output 17 [2023-02-14 01:54:26,943 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 01:54:26,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 01:54:26,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-14 01:54:26,990 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 13 treesize of output 9 [2023-02-14 01:54:26,994 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 13 treesize of output 9 [2023-02-14 01:54:27,029 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 19 treesize of output 7 [2023-02-14 01:54:27,032 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 30 treesize of output 12 [2023-02-14 01:54:27,073 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 15 treesize of output 17 [2023-02-14 01:54:27,082 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 15 treesize of output 17 [2023-02-14 01:54:27,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 01:54:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:27,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:29,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:29,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2023-02-14 01:54:29,694 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-02-14 01:54:29,694 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 148 treesize of output 137 [2023-02-14 01:54:29,701 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 126 treesize of output 110 [2023-02-14 01:54:29,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 110 treesize of output 102 [2023-02-14 01:54:29,721 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2023-02-14 01:54:29,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 22 [2023-02-14 01:54:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:29,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570532048] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:54:29,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:54:29,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 40 [2023-02-14 01:54:29,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400482646] [2023-02-14 01:54:29,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:54:29,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-14 01:54:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:54:29,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-14 01:54:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1310, Unknown=10, NotChecked=0, Total=1560 [2023-02-14 01:54:29,768 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:30,639 INFO L93 Difference]: Finished difference Result 300 states and 364 transitions. [2023-02-14 01:54:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 01:54:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 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 43 [2023-02-14 01:54:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:30,642 INFO L225 Difference]: With dead ends: 300 [2023-02-14 01:54:30,642 INFO L226 Difference]: Without dead ends: 300 [2023-02-14 01:54:30,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=459, Invalid=1981, Unknown=10, NotChecked=0, Total=2450 [2023-02-14 01:54:30,643 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 484 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:30,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 634 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:54:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-02-14 01:54:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 182. [2023-02-14 01:54:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 181 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2023-02-14 01:54:30,647 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 43 [2023-02-14 01:54:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:30,647 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2023-02-14 01:54:30,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2023-02-14 01:54:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 01:54:30,648 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:30,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:54:30,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:30,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-14 01:54:30,853 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:54:30,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:30,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1047774460, now seen corresponding path program 2 times [2023-02-14 01:54:30,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:54:30,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412096168] [2023-02-14 01:54:30,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:30,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:54:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:31,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:54:31,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412096168] [2023-02-14 01:54:31,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412096168] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:31,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503746894] [2023-02-14 01:54:31,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:54:31,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:54:31,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:54:31,253 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:54:31,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-14 01:54:31,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:54:31,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:54:31,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-14 01:54:31,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:31,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:54:31,499 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 01:54:31,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 01:54:31,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:31,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:54:31,545 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 13 treesize of output 9 [2023-02-14 01:54:31,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-14 01:54:31,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:31,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:31,722 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 01:54:31,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 01:54:31,772 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 13 treesize of output 9 [2023-02-14 01:54:31,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:31,810 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 30 treesize of output 12 [2023-02-14 01:54:31,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:31,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:31,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:54:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:31,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:31,928 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1206) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-02-14 01:54:32,365 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 164 treesize of output 156 [2023-02-14 01:54:32,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:32,492 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 47 treesize of output 117 [2023-02-14 01:54:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 01:54:32,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503746894] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:54:32,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:54:32,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 39 [2023-02-14 01:54:32,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487734289] [2023-02-14 01:54:32,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:54:32,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-14 01:54:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:54:32,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-14 01:54:32,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1193, Unknown=6, NotChecked=72, Total=1482 [2023-02-14 01:54:32,598 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand has 39 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:33,754 INFO L93 Difference]: Finished difference Result 303 states and 368 transitions. [2023-02-14 01:54:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 01:54:33,754 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 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 43 [2023-02-14 01:54:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:33,755 INFO L225 Difference]: With dead ends: 303 [2023-02-14 01:54:33,755 INFO L226 Difference]: Without dead ends: 303 [2023-02-14 01:54:33,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=511, Invalid=2241, Unknown=8, NotChecked=102, Total=2862 [2023-02-14 01:54:33,756 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 442 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 91 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:33,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 719 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 912 Invalid, 3 Unknown, 138 Unchecked, 0.5s Time] [2023-02-14 01:54:33,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-02-14 01:54:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 184. [2023-02-14 01:54:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 172 states have (on average 1.313953488372093) internal successors, (226), 183 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 226 transitions. [2023-02-14 01:54:33,759 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 226 transitions. Word has length 43 [2023-02-14 01:54:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:33,759 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 226 transitions. [2023-02-14 01:54:33,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 226 transitions. [2023-02-14 01:54:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 01:54:33,760 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:33,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:54:33,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:33,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-14 01:54:33,960 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:54:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1554014930, now seen corresponding path program 1 times [2023-02-14 01:54:33,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:54:33,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29832304] [2023-02-14 01:54:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:33,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:54:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:34,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:54:34,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29832304] [2023-02-14 01:54:34,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29832304] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:34,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910487794] [2023-02-14 01:54:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:34,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:54:34,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:54:34,316 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:54:34,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-14 01:54:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:34,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-14 01:54:34,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:34,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:54:34,550 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 01:54:34,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 01:54:34,599 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 13 treesize of output 9 [2023-02-14 01:54:34,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:34,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:54:34,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-14 01:54:34,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:34,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:34,763 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 01:54:34,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 01:54:34,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:34,801 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 13 treesize of output 9 [2023-02-14 01:54:34,829 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 30 treesize of output 12 [2023-02-14 01:54:34,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:34,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:34,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:54:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:34,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:34,983 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1328) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2023-02-14 01:54:34,987 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1328) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2023-02-14 01:54:37,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:37,304 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 26 treesize of output 32 [2023-02-14 01:54:37,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:37,312 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 122 treesize of output 121 [2023-02-14 01:54:37,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2023-02-14 01:54:37,319 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 98 treesize of output 94 [2023-02-14 01:54:37,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:37,583 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 62 treesize of output 216 [2023-02-14 01:54:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-14 01:54:38,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910487794] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:54:38,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:54:38,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2023-02-14 01:54:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60284118] [2023-02-14 01:54:38,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:54:38,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-14 01:54:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:54:38,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-14 01:54:38,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1324, Unknown=18, NotChecked=154, Total=1722 [2023-02-14 01:54:38,913 INFO L87 Difference]: Start difference. First operand 184 states and 226 transitions. Second operand has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:40,378 INFO L93 Difference]: Finished difference Result 308 states and 371 transitions. [2023-02-14 01:54:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 01:54:40,378 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 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 43 [2023-02-14 01:54:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:40,379 INFO L225 Difference]: With dead ends: 308 [2023-02-14 01:54:40,379 INFO L226 Difference]: Without dead ends: 308 [2023-02-14 01:54:40,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=573, Invalid=2497, Unknown=18, NotChecked=218, Total=3306 [2023-02-14 01:54:40,381 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 401 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 344 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:40,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1127 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1740 Invalid, 0 Unknown, 344 Unchecked, 0.8s Time] [2023-02-14 01:54:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-02-14 01:54:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 184. [2023-02-14 01:54:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 172 states have (on average 1.308139534883721) internal successors, (225), 183 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 225 transitions. [2023-02-14 01:54:40,384 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 225 transitions. Word has length 43 [2023-02-14 01:54:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:40,384 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 225 transitions. [2023-02-14 01:54:40,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 225 transitions. [2023-02-14 01:54:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 01:54:40,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:40,385 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:54:40,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:40,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:54:40,590 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:54:40,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:40,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1553707100, now seen corresponding path program 1 times [2023-02-14 01:54:40,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:54:40,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159814422] [2023-02-14 01:54:40,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:40,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:54:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:41,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:54:41,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159814422] [2023-02-14 01:54:41,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159814422] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:41,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458816098] [2023-02-14 01:54:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:41,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:54:41,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:54:41,132 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:54:41,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-14 01:54:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:41,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-14 01:54:41,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:41,281 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-14 01:54:41,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:41,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:54:41,338 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 01:54:41,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 01:54:41,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-14 01:54:41,395 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 13 treesize of output 9 [2023-02-14 01:54:41,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 01:54:41,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:41,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:41,531 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 01:54:41,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 01:54:41,560 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 13 treesize of output 9 [2023-02-14 01:54:41,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:41,595 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 30 treesize of output 12 [2023-02-14 01:54:41,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:41,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:54:41,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:54:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:54:41,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:41,674 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1452 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2023-02-14 01:54:41,683 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1452 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2023-02-14 01:54:41,686 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1452 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2023-02-14 01:54:41,690 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1449) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2023-02-14 01:54:42,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:54:42,066 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2023-02-14 01:54:42,076 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-02-14 01:54:42,077 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 70 treesize of output 65 [2023-02-14 01:54:42,082 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 54 treesize of output 46 [2023-02-14 01:54:42,086 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 20 [2023-02-14 01:54:42,099 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2023-02-14 01:54:42,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 22 [2023-02-14 01:54:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-02-14 01:54:42,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458816098] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:54:42,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:54:42,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 40 [2023-02-14 01:54:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96382636] [2023-02-14 01:54:42,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:54:42,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-14 01:54:42,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:54:42,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-14 01:54:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1050, Unknown=8, NotChecked=284, Total=1560 [2023-02-14 01:54:42,143 INFO L87 Difference]: Start difference. First operand 184 states and 225 transitions. Second operand has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:54:45,461 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-14 01:54:48,129 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-14 01:54:50,368 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-14 01:54:52,404 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-14 01:54:54,417 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-14 01:54:56,440 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-14 01:54:58,492 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-14 01:55:00,915 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1444 Int) (v_ArrVal_1452 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|) 0)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1444)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1449) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1449) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-14 01:55:02,063 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1444 Int) (v_ArrVal_1452 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|) 0)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1444)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1449) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1449) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)))) is different from false [2023-02-14 01:55:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:04,366 INFO L93 Difference]: Finished difference Result 507 states and 637 transitions. [2023-02-14 01:55:04,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-02-14 01:55:04,366 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 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 43 [2023-02-14 01:55:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:04,368 INFO L225 Difference]: With dead ends: 507 [2023-02-14 01:55:04,368 INFO L226 Difference]: Without dead ends: 507 [2023-02-14 01:55:04,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=910, Invalid=4881, Unknown=85, NotChecked=930, Total=6806 [2023-02-14 01:55:04,371 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 658 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 115 mSolverCounterUnsat, 140 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 2876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 140 IncrementalHoareTripleChecker+Unknown, 978 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:04,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1020 Invalid, 2876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1643 Invalid, 140 Unknown, 978 Unchecked, 16.2s Time] [2023-02-14 01:55:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2023-02-14 01:55:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 231. [2023-02-14 01:55:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 219 states have (on average 1.2876712328767124) internal successors, (282), 230 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 282 transitions. [2023-02-14 01:55:04,375 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 282 transitions. Word has length 43 [2023-02-14 01:55:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:04,376 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 282 transitions. [2023-02-14 01:55:04,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 282 transitions. [2023-02-14 01:55:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 01:55:04,376 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:04,376 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:55:04,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-14 01:55:04,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:55:04,582 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:55:04,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:04,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1888926888, now seen corresponding path program 2 times [2023-02-14 01:55:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:55:04,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015662083] [2023-02-14 01:55:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:55:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:04,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:55:04,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015662083] [2023-02-14 01:55:04,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015662083] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:55:04,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809005273] [2023-02-14 01:55:04,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:55:04,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:55:04,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:55:04,982 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:55:04,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-14 01:55:05,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:55:05,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:55:05,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-14 01:55:05,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:05,159 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:55:05,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:55:05,175 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 13 treesize of output 9 [2023-02-14 01:55:05,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:05,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:05,259 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:55:05,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:55:05,271 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 21 treesize of output 20 [2023-02-14 01:55:05,392 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-14 01:55:05,393 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 51 treesize of output 53 [2023-02-14 01:55:05,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 01:55:05,468 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-14 01:55:05,468 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 60 treesize of output 60 [2023-02-14 01:55:05,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 01:55:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:05,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:05,582 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1568 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2023-02-14 01:55:05,678 INFO L321 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2023-02-14 01:55:05,678 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 31 treesize of output 30 [2023-02-14 01:55:05,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:05,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-14 01:55:05,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:05,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-14 01:55:05,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:05,884 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 86 treesize of output 85 [2023-02-14 01:55:05,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:05,892 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 80 treesize of output 64 [2023-02-14 01:55:05,895 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 50 treesize of output 42 [2023-02-14 01:55:05,903 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 01:55:05,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-14 01:55:06,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:06,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-14 01:55:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 01:55:06,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809005273] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:55:06,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:55:06,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 34 [2023-02-14 01:55:06,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884367569] [2023-02-14 01:55:06,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:55:06,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 01:55:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:55:06,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 01:55:06,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=954, Unknown=33, NotChecked=64, Total=1190 [2023-02-14 01:55:06,187 INFO L87 Difference]: Start difference. First operand 231 states and 282 transitions. Second operand has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:07,374 INFO L93 Difference]: Finished difference Result 386 states and 469 transitions. [2023-02-14 01:55:07,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 01:55:07,374 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-14 01:55:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:07,375 INFO L225 Difference]: With dead ends: 386 [2023-02-14 01:55:07,375 INFO L226 Difference]: Without dead ends: 386 [2023-02-14 01:55:07,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=386, Invalid=1936, Unknown=34, NotChecked=94, Total=2450 [2023-02-14 01:55:07,376 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 483 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:07,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 768 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1098 Invalid, 0 Unknown, 128 Unchecked, 0.7s Time] [2023-02-14 01:55:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-02-14 01:55:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 266. [2023-02-14 01:55:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 254 states have (on average 1.2716535433070866) internal successors, (323), 265 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 323 transitions. [2023-02-14 01:55:07,379 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 323 transitions. Word has length 45 [2023-02-14 01:55:07,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:07,379 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 323 transitions. [2023-02-14 01:55:07,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:07,379 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 323 transitions. [2023-02-14 01:55:07,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 01:55:07,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:07,388 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:55:07,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-14 01:55:07,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-14 01:55:07,594 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:55:07,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1888926889, now seen corresponding path program 2 times [2023-02-14 01:55:07,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:55:07,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998996475] [2023-02-14 01:55:07,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:07,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:55:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:08,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:55:08,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998996475] [2023-02-14 01:55:08,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998996475] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:55:08,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682569219] [2023-02-14 01:55:08,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:55:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:55:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:55:08,274 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:55:08,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-14 01:55:08,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:55:08,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:55:08,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-14 01:55:08,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:08,474 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:55:08,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:55:08,491 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-14 01:55:08,501 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 13 treesize of output 9 [2023-02-14 01:55:08,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:08,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:08,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:08,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:08,620 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:55:08,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:55:08,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:08,650 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 21 treesize of output 20 [2023-02-14 01:55:08,828 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:55:08,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 01:55:08,852 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-14 01:55:08,852 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 53 treesize of output 55 [2023-02-14 01:55:08,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 01:55:08,973 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-14 01:55:08,974 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 75 treesize of output 73 [2023-02-14 01:55:08,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:08,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:08,999 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 01:55:09,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 01:55:09,124 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 15 treesize of output 7 [2023-02-14 01:55:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:09,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:09,224 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1690) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1691) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_1690 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1690) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2023-02-14 01:55:09,247 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1690 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1690) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1690) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1691) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2023-02-14 01:55:09,256 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1690 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1690) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1690) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1691) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2023-02-14 01:55:09,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:09,265 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 63 treesize of output 67 [2023-02-14 01:55:09,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:09,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-14 01:55:09,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:09,840 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 109 treesize of output 100 [2023-02-14 01:55:09,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:09,846 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 89 treesize of output 90 [2023-02-14 01:55:09,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:09,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 171 [2023-02-14 01:55:09,861 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 155 treesize of output 147 [2023-02-14 01:55:09,865 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 147 treesize of output 139 [2023-02-14 01:55:09,869 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 139 treesize of output 135 [2023-02-14 01:55:09,873 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 135 treesize of output 131 [2023-02-14 01:55:09,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:09,885 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 198 treesize of output 197 [2023-02-14 01:55:09,891 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 181 treesize of output 173 [2023-02-14 01:55:09,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:09,900 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 173 treesize of output 158 [2023-02-14 01:55:09,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:09,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 196 [2023-02-14 01:55:10,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:10,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-14 01:55:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-02-14 01:55:10,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682569219] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:55:10,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:55:10,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 16] total 38 [2023-02-14 01:55:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937608218] [2023-02-14 01:55:10,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:55:10,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-14 01:55:10,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:55:10,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-14 01:55:10,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1111, Unknown=16, NotChecked=210, Total=1482 [2023-02-14 01:55:10,461 INFO L87 Difference]: Start difference. First operand 266 states and 323 transitions. Second operand has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:12,432 INFO L93 Difference]: Finished difference Result 395 states and 476 transitions. [2023-02-14 01:55:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-14 01:55:12,432 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-14 01:55:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:12,433 INFO L225 Difference]: With dead ends: 395 [2023-02-14 01:55:12,433 INFO L226 Difference]: Without dead ends: 395 [2023-02-14 01:55:12,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=507, Invalid=3029, Unknown=16, NotChecked=354, Total=3906 [2023-02-14 01:55:12,434 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 544 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 82 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 446 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:12,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1007 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1377 Invalid, 2 Unknown, 446 Unchecked, 1.0s Time] [2023-02-14 01:55:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2023-02-14 01:55:12,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 274. [2023-02-14 01:55:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 262 states have (on average 1.2748091603053435) internal successors, (334), 273 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 334 transitions. [2023-02-14 01:55:12,437 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 334 transitions. Word has length 45 [2023-02-14 01:55:12,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:12,437 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 334 transitions. [2023-02-14 01:55:12,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 334 transitions. [2023-02-14 01:55:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:55:12,441 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:12,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:55:12,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-14 01:55:12,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-14 01:55:12,647 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:55:12,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash 992568690, now seen corresponding path program 1 times [2023-02-14 01:55:12,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:55:12,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544993321] [2023-02-14 01:55:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:55:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:55:12,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544993321] [2023-02-14 01:55:12,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544993321] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:55:12,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927138968] [2023-02-14 01:55:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:12,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:55:12,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:55:12,949 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:55:12,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-14 01:55:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:13,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-14 01:55:13,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:13,175 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:55:13,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:55:13,198 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 13 treesize of output 9 [2023-02-14 01:55:13,271 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:55:13,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-14 01:55:13,286 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:55:13,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 01:55:13,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:13,430 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 27 treesize of output 21 [2023-02-14 01:55:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:13,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:13,547 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2023-02-14 01:55:13,579 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1765) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2023-02-14 01:55:13,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:13,582 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 20 treesize of output 21 [2023-02-14 01:55:13,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:13,587 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 32 treesize of output 33 [2023-02-14 01:55:13,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 01:55:13,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:13,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-14 01:55:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2023-02-14 01:55:13,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927138968] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:55:13,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:55:13,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 15] total 36 [2023-02-14 01:55:13,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699666758] [2023-02-14 01:55:13,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:55:13,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-14 01:55:13,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:55:13,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-14 01:55:13,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=8, NotChecked=134, Total=1332 [2023-02-14 01:55:13,784 INFO L87 Difference]: Start difference. First operand 274 states and 334 transitions. Second operand has 37 states, 36 states have (on average 3.2222222222222223) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:14,514 INFO L93 Difference]: Finished difference Result 302 states and 363 transitions. [2023-02-14 01:55:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-14 01:55:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.2222222222222223) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-14 01:55:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:14,515 INFO L225 Difference]: With dead ends: 302 [2023-02-14 01:55:14,516 INFO L226 Difference]: Without dead ends: 302 [2023-02-14 01:55:14,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=491, Invalid=2159, Unknown=10, NotChecked=202, Total=2862 [2023-02-14 01:55:14,517 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 443 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:14,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 817 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1039 Invalid, 2 Unknown, 211 Unchecked, 0.4s Time] [2023-02-14 01:55:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-02-14 01:55:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 268. [2023-02-14 01:55:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 256 states have (on average 1.27734375) internal successors, (327), 267 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 327 transitions. [2023-02-14 01:55:14,525 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 327 transitions. Word has length 46 [2023-02-14 01:55:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:14,525 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 327 transitions. [2023-02-14 01:55:14,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.2222222222222223) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 327 transitions. [2023-02-14 01:55:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:55:14,528 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:14,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:55:14,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-14 01:55:14,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-14 01:55:14,734 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:55:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:14,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1084740117, now seen corresponding path program 2 times [2023-02-14 01:55:14,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:55:14,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963757777] [2023-02-14 01:55:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:55:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:15,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:55:15,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963757777] [2023-02-14 01:55:15,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963757777] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:55:15,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210330906] [2023-02-14 01:55:15,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:55:15,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:55:15,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:55:15,103 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:55:15,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-14 01:55:15,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:55:15,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:55:15,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-14 01:55:15,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:15,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:55:15,338 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:55:15,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:55:15,366 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 13 treesize of output 9 [2023-02-14 01:55:15,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:15,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:55:15,393 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 20 treesize of output 8 [2023-02-14 01:55:15,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:15,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:15,467 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:55:15,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 01:55:15,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:55:15,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:15,512 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 20 treesize of output 8 [2023-02-14 01:55:15,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:15,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 01:55:15,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:55:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:15,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:15,682 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1888 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2023-02-14 01:55:15,814 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1886) |v_ULTIMATE.start_main_~t~0#1.base_41| v_ArrVal_1888) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) is different from false [2023-02-14 01:55:15,897 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 01:55:15,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-14 01:55:16,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:16,032 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 26 treesize of output 32 [2023-02-14 01:55:16,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:16,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 121 [2023-02-14 01:55:16,053 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 53 treesize of output 49 [2023-02-14 01:55:16,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2023-02-14 01:55:16,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:16,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-14 01:55:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-02-14 01:55:16,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210330906] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:55:16,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:55:16,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 46 [2023-02-14 01:55:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791527420] [2023-02-14 01:55:16,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:55:16,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 01:55:16,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:55:16,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 01:55:16,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1645, Unknown=30, NotChecked=170, Total=2070 [2023-02-14 01:55:16,308 INFO L87 Difference]: Start difference. First operand 268 states and 327 transitions. Second operand has 46 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 46 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:27,317 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-14 01:55:29,779 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-14 01:55:34,244 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_41| Int)) (or (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1886) |v_ULTIMATE.start_main_~t~0#1.base_41| v_ArrVal_1888) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_41|) 0)))) (forall ((v_ArrVal_1888 (Array Int Int))) (< (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1888) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-14 01:55:34,276 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1888 (Array Int Int))) (< (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1888) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-14 01:55:34,409 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1888 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2023-02-14 01:55:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:37,207 INFO L93 Difference]: Finished difference Result 649 states and 801 transitions. [2023-02-14 01:55:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-14 01:55:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 46 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-14 01:55:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:37,209 INFO L225 Difference]: With dead ends: 649 [2023-02-14 01:55:37,209 INFO L226 Difference]: Without dead ends: 649 [2023-02-14 01:55:37,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1522 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=906, Invalid=5055, Unknown=65, NotChecked=780, Total=6806 [2023-02-14 01:55:37,210 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 651 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 148 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 387 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:37,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1368 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1616 Invalid, 30 Unknown, 387 Unchecked, 5.1s Time] [2023-02-14 01:55:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-02-14 01:55:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 287. [2023-02-14 01:55:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 275 states have (on average 1.2654545454545454) internal successors, (348), 286 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 348 transitions. [2023-02-14 01:55:37,221 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 348 transitions. Word has length 46 [2023-02-14 01:55:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:37,221 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 348 transitions. [2023-02-14 01:55:37,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 46 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 348 transitions. [2023-02-14 01:55:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:55:37,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:37,222 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:55:37,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-14 01:55:37,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-14 01:55:37,427 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:55:37,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1165567219, now seen corresponding path program 1 times [2023-02-14 01:55:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:55:37,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385294521] [2023-02-14 01:55:37,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:55:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:37,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:55:37,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385294521] [2023-02-14 01:55:37,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385294521] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:55:37,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377000337] [2023-02-14 01:55:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:37,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:55:37,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:55:37,482 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:55:37,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-14 01:55:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:37,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 01:55:37,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:37,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:37,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377000337] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:55:37,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:55:37,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-02-14 01:55:37,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572766653] [2023-02-14 01:55:37,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:55:37,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:55:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:55:37,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:55:37,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:55:37,788 INFO L87 Difference]: Start difference. First operand 287 states and 348 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:37,865 INFO L93 Difference]: Finished difference Result 653 states and 725 transitions. [2023-02-14 01:55:37,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 01:55:37,866 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-14 01:55:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:37,867 INFO L225 Difference]: With dead ends: 653 [2023-02-14 01:55:37,867 INFO L226 Difference]: Without dead ends: 653 [2023-02-14 01:55:37,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2023-02-14 01:55:37,868 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 552 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:37,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 541 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:55:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2023-02-14 01:55:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 396. [2023-02-14 01:55:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 384 states have (on average 1.2005208333333333) internal successors, (461), 395 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 461 transitions. [2023-02-14 01:55:37,873 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 461 transitions. Word has length 46 [2023-02-14 01:55:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:37,873 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 461 transitions. [2023-02-14 01:55:37,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:55:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 461 transitions. [2023-02-14 01:55:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 01:55:37,873 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:37,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:55:37,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-14 01:55:38,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:55:38,074 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-14 01:55:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash 375777400, now seen corresponding path program 1 times [2023-02-14 01:55:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:55:38,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274295554] [2023-02-14 01:55:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:38,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:55:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:55:38,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:55:38,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274295554] [2023-02-14 01:55:38,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274295554] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:55:38,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536808242] [2023-02-14 01:55:38,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:38,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:55:38,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:55:38,649 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:55:38,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-14 01:55:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:38,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-14 01:55:38,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:39,019 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-14 01:55:39,191 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:55:39,191 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 45 treesize of output 43 [2023-02-14 01:55:39,206 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:55:39,206 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 42 treesize of output 43 [2023-02-14 01:55:39,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:39,437 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 29 [2023-02-14 01:55:39,605 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~p~0#1.base_156| Int) (v_ArrVal_2072 Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_156| 1))) (and (= 0 (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_156|)) (= |c_#valid| (store (store .cse0 |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2072) |v_ULTIMATE.start_main_~p~0#1.base_156| 0)) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) 0)))) is different from true [2023-02-14 01:55:39,630 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~p~0#1.base| Int) (|v_ULTIMATE.start_main_~p~0#1.base_156| Int) (v_ArrVal_2072 Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_156| 1))) (and (= 0 (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_156|)) (= |c_#valid| (store (store (store .cse0 |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2072) |v_ULTIMATE.start_main_~p~0#1.base_156| 0) |ULTIMATE.start_main_~p~0#1.base| 0)) (= (select .cse0 |ULTIMATE.start_main_~p~0#1.base|) 0)))) is different from true [2023-02-14 01:55:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-14 01:55:39,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:39,796 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2076 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2076) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-02-14 01:55:39,804 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2076 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2076) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2023-02-14 01:55:39,807 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2076 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2076) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-02-14 01:55:39,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:39,810 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 30 treesize of output 31 [2023-02-14 01:55:39,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:55:39,830 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 52 treesize of output 53 [2023-02-14 01:55:39,832 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 17 [2023-02-14 01:57:25,726 WARN L233 SmtUtils]: Spent 1.44m on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:57:49,969 WARN L233 SmtUtils]: Spent 24.12s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)