./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c 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/verifythis/prefixsum_iter.c -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 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:45:02,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:45:02,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:45:02,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:45:02,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:45:02,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:45:02,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:45:02,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:45:02,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:45:02,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:45:02,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:45:02,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:45:02,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:45:02,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:45:02,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:45:02,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:45:02,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:45:02,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:45:02,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:45:02,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:45:02,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:45:02,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:45:02,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:45:02,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:45:02,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:45:02,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:45:02,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:45:02,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:45:02,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:45:02,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:45:02,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:45:02,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:45:02,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:45:02,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:45:02,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:45:02,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:45:02,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:45:02,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:45:02,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:45:02,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:45:02,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:45:02,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 02:45:02,621 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:45:02,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:45:02,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:45:02,621 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:45:02,621 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:45:02,621 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:45:02,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:45:02,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:45:02,622 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:45:02,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:45:02,623 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:45:02,623 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 02:45:02,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:45:02,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:45:02,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:45:02,624 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 02:45:02,624 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 02:45:02,624 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 02:45:02,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:45:02,624 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 02:45:02,624 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:45:02,624 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:45:02,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:45:02,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:45:02,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:45:02,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:45:02,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:45:02,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:45:02,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:45:02,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:45:02,626 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:45:02,626 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:45:02,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:45:02,626 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:45:02,627 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 -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d [2023-02-17 02:45:02,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:45:02,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:45:02,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:45:02,842 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:45:02,842 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:45:02,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_iter.c [2023-02-17 02:45:03,802 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:45:03,984 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:45:03,985 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2023-02-17 02:45:03,989 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b98785e/5d9dca02a03f4900864f8889a1be4056/FLAGb14bb155a [2023-02-17 02:45:04,001 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b98785e/5d9dca02a03f4900864f8889a1be4056 [2023-02-17 02:45:04,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:45:04,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:45:04,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:45:04,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:45:04,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:45:04,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44325a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04, skipping insertion in model container [2023-02-17 02:45:04,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:45:04,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:45:04,120 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/verifythis/prefixsum_iter.c[526,539] [2023-02-17 02:45:04,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:45:04,162 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:45:04,174 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/verifythis/prefixsum_iter.c[526,539] [2023-02-17 02:45:04,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:45:04,211 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:45:04,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04 WrapperNode [2023-02-17 02:45:04,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:45:04,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:45:04,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:45:04,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:45:04,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,258 INFO L138 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2023-02-17 02:45:04,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:45:04,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:45:04,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:45:04,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:45:04,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,281 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:45:04,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:45:04,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:45:04,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:45:04,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (1/1) ... [2023-02-17 02:45:04,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:45:04,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:04,309 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-17 02:45:04,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:45:04,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 02:45:04,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 02:45:04,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:45:04,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 02:45:04,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 02:45:04,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:45:04,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:45:04,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 02:45:04,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-02-17 02:45:04,321 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-17 02:45:04,337 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-02-17 02:45:04,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 02:45:04,425 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:45:04,427 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:45:04,771 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:45:04,778 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:45:04,779 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2023-02-17 02:45:04,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:45:04 BoogieIcfgContainer [2023-02-17 02:45:04,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:45:04,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:45:04,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:45:04,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:45:04,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:45:04" (1/3) ... [2023-02-17 02:45:04,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177c78d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:45:04, skipping insertion in model container [2023-02-17 02:45:04,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:45:04" (2/3) ... [2023-02-17 02:45:04,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177c78d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:45:04, skipping insertion in model container [2023-02-17 02:45:04,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:45:04" (3/3) ... [2023-02-17 02:45:04,786 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2023-02-17 02:45:04,805 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:45:04,805 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-02-17 02:45:04,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:45:04,855 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;@2d16e048, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:45:04,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2023-02-17 02:45:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 61 states have (on average 1.819672131147541) internal successors, (111), 95 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 02:45:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 02:45:04,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:04,866 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] [2023-02-17 02:45:04,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1116940539, now seen corresponding path program 1 times [2023-02-17 02:45:04,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:04,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314944022] [2023-02-17 02:45:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:05,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:05,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:05,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:05,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314944022] [2023-02-17 02:45:05,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314944022] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:45:05,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:45:05,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:45:05,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235725707] [2023-02-17 02:45:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:45:05,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:45:05,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:05,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:45:05,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:45:05,127 INFO L87 Difference]: Start difference. First operand has 102 states, 61 states have (on average 1.819672131147541) internal successors, (111), 95 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:45:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:05,198 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2023-02-17 02:45:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:45:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-02-17 02:45:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:05,205 INFO L225 Difference]: With dead ends: 102 [2023-02-17 02:45:05,205 INFO L226 Difference]: Without dead ends: 100 [2023-02-17 02:45:05,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:45:05,210 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:05,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 192 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:45:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-17 02:45:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-17 02:45:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 02:45:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-02-17 02:45:05,240 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 29 [2023-02-17 02:45:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:05,240 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-02-17 02:45:05,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:45:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-02-17 02:45:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 02:45:05,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:05,242 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] [2023-02-17 02:45:05,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 02:45:05,242 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:05,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:05,243 INFO L85 PathProgramCache]: Analyzing trace with hash 236420795, now seen corresponding path program 1 times [2023-02-17 02:45:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:05,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746147470] [2023-02-17 02:45:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:05,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:05,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:05,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746147470] [2023-02-17 02:45:05,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746147470] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:45:05,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:45:05,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:45:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196102617] [2023-02-17 02:45:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:45:05,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:45:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:05,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:45:05,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:45:05,481 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:45:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:05,578 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-02-17 02:45:05,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:45:05,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-02-17 02:45:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:05,580 INFO L225 Difference]: With dead ends: 98 [2023-02-17 02:45:05,580 INFO L226 Difference]: Without dead ends: 98 [2023-02-17 02:45:05,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:45:05,581 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 153 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:05,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 155 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:45:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-17 02:45:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-17 02:45:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 91 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 02:45:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-02-17 02:45:05,589 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 29 [2023-02-17 02:45:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:05,590 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-02-17 02:45:05,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:45:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-02-17 02:45:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 02:45:05,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:05,592 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] [2023-02-17 02:45:05,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 02:45:05,592 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash 236420796, now seen corresponding path program 1 times [2023-02-17 02:45:05,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:05,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060644784] [2023-02-17 02:45:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:05,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:06,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:06,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:06,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:06,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:06,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060644784] [2023-02-17 02:45:06,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060644784] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:45:06,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:45:06,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-17 02:45:06,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268587760] [2023-02-17 02:45:06,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:45:06,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:45:06,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:06,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:45:06,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:45:06,078 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 02:45:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:06,755 INFO L93 Difference]: Finished difference Result 260 states and 282 transitions. [2023-02-17 02:45:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:45:06,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2023-02-17 02:45:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:06,757 INFO L225 Difference]: With dead ends: 260 [2023-02-17 02:45:06,758 INFO L226 Difference]: Without dead ends: 260 [2023-02-17 02:45:06,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2023-02-17 02:45:06,759 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 914 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:06,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 433 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:45:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-17 02:45:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 148. [2023-02-17 02:45:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 107 states have (on average 1.6728971962616823) internal successors, (179), 138 states have internal predecessors, (179), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 193 transitions. [2023-02-17 02:45:06,778 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 193 transitions. Word has length 29 [2023-02-17 02:45:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:06,778 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 193 transitions. [2023-02-17 02:45:06,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 02:45:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 193 transitions. [2023-02-17 02:45:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 02:45:06,781 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:06,781 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] [2023-02-17 02:45:06,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 02:45:06,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1260889940, now seen corresponding path program 1 times [2023-02-17 02:45:06,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:06,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006639422] [2023-02-17 02:45:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:06,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:06,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:06,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:06,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:06,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006639422] [2023-02-17 02:45:06,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006639422] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:45:06,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:45:06,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:45:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176444702] [2023-02-17 02:45:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:45:06,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:45:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:06,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:45:06,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:45:06,851 INFO L87 Difference]: Start difference. First operand 148 states and 193 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:45:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:06,909 INFO L93 Difference]: Finished difference Result 147 states and 191 transitions. [2023-02-17 02:45:06,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:45:06,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-02-17 02:45:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:06,913 INFO L225 Difference]: With dead ends: 147 [2023-02-17 02:45:06,913 INFO L226 Difference]: Without dead ends: 147 [2023-02-17 02:45:06,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:45:06,918 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 150 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:06,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 165 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:45:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-17 02:45:06,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2023-02-17 02:45:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.6542056074766356) internal successors, (177), 137 states have internal predecessors, (177), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2023-02-17 02:45:06,937 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 30 [2023-02-17 02:45:06,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:06,938 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2023-02-17 02:45:06,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:45:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2023-02-17 02:45:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 02:45:06,941 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:06,942 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] [2023-02-17 02:45:06,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 02:45:06,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1260889939, now seen corresponding path program 1 times [2023-02-17 02:45:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:06,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249779869] [2023-02-17 02:45:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:06,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:07,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:07,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249779869] [2023-02-17 02:45:07,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249779869] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:45:07,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:45:07,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 02:45:07,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866088171] [2023-02-17 02:45:07,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:45:07,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 02:45:07,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:07,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 02:45:07,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:45:07,115 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:45:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:07,369 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2023-02-17 02:45:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:45:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2023-02-17 02:45:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:07,371 INFO L225 Difference]: With dead ends: 257 [2023-02-17 02:45:07,371 INFO L226 Difference]: Without dead ends: 257 [2023-02-17 02:45:07,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:45:07,371 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 405 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:07,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 258 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:45:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-02-17 02:45:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 147. [2023-02-17 02:45:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 137 states have internal predecessors, (177), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2023-02-17 02:45:07,376 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 30 [2023-02-17 02:45:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:07,376 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2023-02-17 02:45:07,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:45:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2023-02-17 02:45:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 02:45:07,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:07,377 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] [2023-02-17 02:45:07,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 02:45:07,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:07,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:07,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1311333523, now seen corresponding path program 1 times [2023-02-17 02:45:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:07,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612287442] [2023-02-17 02:45:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:07,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:45:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:45:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:45:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:07,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:07,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612287442] [2023-02-17 02:45:07,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612287442] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:07,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118318837] [2023-02-17 02:45:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:07,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:07,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:07,738 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-17 02:45:07,766 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-17 02:45:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:07,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 02:45:07,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:07,903 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-17 02:45:07,906 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-17 02:45:08,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:45:08,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-17 02:45:08,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:45:08,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 02:45:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 02:45:08,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:08,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118318837] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:08,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:45:08,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2023-02-17 02:45:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914852259] [2023-02-17 02:45:08,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:08,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 02:45:08,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:08,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 02:45:08,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2023-02-17 02:45:08,309 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 02:45:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:09,370 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2023-02-17 02:45:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 02:45:09,371 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 30 [2023-02-17 02:45:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:09,372 INFO L225 Difference]: With dead ends: 259 [2023-02-17 02:45:09,372 INFO L226 Difference]: Without dead ends: 259 [2023-02-17 02:45:09,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2023-02-17 02:45:09,373 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1577 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:09,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 686 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 02:45:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-02-17 02:45:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 146. [2023-02-17 02:45:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.6261682242990654) internal successors, (174), 136 states have internal predecessors, (174), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 188 transitions. [2023-02-17 02:45:09,377 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 188 transitions. Word has length 30 [2023-02-17 02:45:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:09,377 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 188 transitions. [2023-02-17 02:45:09,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 02:45:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2023-02-17 02:45:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 02:45:09,378 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:09,378 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] [2023-02-17 02:45:09,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 02:45:09,584 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,SelfDestructingSolverStorable5 [2023-02-17 02:45:09,585 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -535927024, now seen corresponding path program 1 times [2023-02-17 02:45:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:09,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713034660] [2023-02-17 02:45:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:09,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:09,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:09,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:09,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713034660] [2023-02-17 02:45:09,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713034660] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:45:09,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:45:09,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 02:45:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192742326] [2023-02-17 02:45:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:45:09,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:45:09,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:09,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:45:09,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:45:09,672 INFO L87 Difference]: Start difference. First operand 146 states and 188 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:09,774 INFO L93 Difference]: Finished difference Result 247 states and 267 transitions. [2023-02-17 02:45:09,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:45:09,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-02-17 02:45:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:09,775 INFO L225 Difference]: With dead ends: 247 [2023-02-17 02:45:09,775 INFO L226 Difference]: Without dead ends: 247 [2023-02-17 02:45:09,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-02-17 02:45:09,776 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 335 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:09,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 476 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:45:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-17 02:45:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 140. [2023-02-17 02:45:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 130 states have internal predecessors, (160), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2023-02-17 02:45:09,781 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 32 [2023-02-17 02:45:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:09,783 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2023-02-17 02:45:09,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2023-02-17 02:45:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 02:45:09,786 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:09,786 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] [2023-02-17 02:45:09,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 02:45:09,786 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash 566089799, now seen corresponding path program 1 times [2023-02-17 02:45:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:09,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679048036] [2023-02-17 02:45:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:09,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:09,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:09,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:09,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:09,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679048036] [2023-02-17 02:45:09,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679048036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:45:09,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:45:09,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:45:09,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872334174] [2023-02-17 02:45:09,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:45:09,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:45:09,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:09,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:45:09,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:45:09,874 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:45:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:09,947 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2023-02-17 02:45:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:45:09,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-02-17 02:45:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:09,949 INFO L225 Difference]: With dead ends: 134 [2023-02-17 02:45:09,949 INFO L226 Difference]: Without dead ends: 134 [2023-02-17 02:45:09,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:45:09,950 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 175 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:09,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 166 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:45:09,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-17 02:45:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-02-17 02:45:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 124 states have internal predecessors, (148), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2023-02-17 02:45:09,955 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 33 [2023-02-17 02:45:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:09,955 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2023-02-17 02:45:09,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:45:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2023-02-17 02:45:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 02:45:09,958 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:09,958 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] [2023-02-17 02:45:09,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 02:45:09,959 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash 566089800, now seen corresponding path program 1 times [2023-02-17 02:45:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:09,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201731226] [2023-02-17 02:45:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:09,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:45:10,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:10,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201731226] [2023-02-17 02:45:10,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201731226] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:45:10,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:45:10,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 02:45:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14257802] [2023-02-17 02:45:10,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:45:10,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:45:10,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:10,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:45:10,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:45:10,102 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:45:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:10,260 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2023-02-17 02:45:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 02:45:10,260 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-02-17 02:45:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:10,261 INFO L225 Difference]: With dead ends: 177 [2023-02-17 02:45:10,261 INFO L226 Difference]: Without dead ends: 177 [2023-02-17 02:45:10,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-02-17 02:45:10,262 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 342 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:10,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 851 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:45:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-17 02:45:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 93. [2023-02-17 02:45:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 86 states have internal predecessors, (93), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 02:45:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2023-02-17 02:45:10,265 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 33 [2023-02-17 02:45:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:10,265 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2023-02-17 02:45:10,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:45:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2023-02-17 02:45:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 02:45:10,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:10,266 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-17 02:45:10,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 02:45:10,266 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1785256912, now seen corresponding path program 1 times [2023-02-17 02:45:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:10,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846912305] [2023-02-17 02:45:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:45:10,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:10,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846912305] [2023-02-17 02:45:10,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846912305] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:10,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041177008] [2023-02-17 02:45:10,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:10,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:10,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:10,411 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-17 02:45:10,413 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-17 02:45:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:10,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 02:45:10,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:10,496 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-17 02:45:10,500 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 10 treesize of output 9 [2023-02-17 02:45:10,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:45:10,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 40 [2023-02-17 02:45:10,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:45:10,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 02:45:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:45:11,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:11,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041177008] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:11,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:45:11,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-02-17 02:45:11,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379495169] [2023-02-17 02:45:11,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:11,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 02:45:11,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:11,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 02:45:11,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=597, Unknown=1, NotChecked=0, Total=702 [2023-02-17 02:45:11,722 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:45:17,294 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 [0] [2023-02-17 02:45:19,357 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 [0] [2023-02-17 02:45:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:20,280 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2023-02-17 02:45:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-17 02:45:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) Word has length 34 [2023-02-17 02:45:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:20,282 INFO L225 Difference]: With dead ends: 245 [2023-02-17 02:45:20,282 INFO L226 Difference]: Without dead ends: 245 [2023-02-17 02:45:20,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=514, Invalid=2240, Unknown=2, NotChecked=0, Total=2756 [2023-02-17 02:45:20,283 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 817 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 43 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:20,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 765 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1259 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2023-02-17 02:45:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-02-17 02:45:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 115. [2023-02-17 02:45:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 104 states have internal predecessors, (113), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2023-02-17 02:45:20,305 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 34 [2023-02-17 02:45:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:20,305 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2023-02-17 02:45:20,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:45:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2023-02-17 02:45:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 02:45:20,306 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:20,306 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-17 02:45:20,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 02:45:20,512 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,SelfDestructingSolverStorable9 [2023-02-17 02:45:20,512 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:20,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1082556080, now seen corresponding path program 1 times [2023-02-17 02:45:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:20,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237864088] [2023-02-17 02:45:20,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:20,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:20,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:45:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:45:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:20,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:45:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:45:20,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:20,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237864088] [2023-02-17 02:45:20,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237864088] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:20,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680279010] [2023-02-17 02:45:20,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:20,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:20,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:20,697 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-17 02:45:20,701 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-17 02:45:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:20,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 02:45:20,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:20,755 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 10 treesize of output 9 [2023-02-17 02:45:20,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:45:20,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 38 [2023-02-17 02:45:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:45:21,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:21,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680279010] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:21,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:45:21,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-02-17 02:45:21,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240324465] [2023-02-17 02:45:21,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:21,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 02:45:21,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 02:45:21,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:45:21,231 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 02:45:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:21,975 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2023-02-17 02:45:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 02:45:21,976 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2023-02-17 02:45:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:21,976 INFO L225 Difference]: With dead ends: 113 [2023-02-17 02:45:21,976 INFO L226 Difference]: Without dead ends: 113 [2023-02-17 02:45:21,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2023-02-17 02:45:21,977 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 246 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:21,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 255 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 02:45:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-17 02:45:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-02-17 02:45:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 102 states have internal predecessors, (111), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2023-02-17 02:45:21,980 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 36 [2023-02-17 02:45:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:21,980 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2023-02-17 02:45:21,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 02:45:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2023-02-17 02:45:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 02:45:21,980 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:21,980 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] [2023-02-17 02:45:21,988 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-17 02:45:22,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:22,186 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 7143804, now seen corresponding path program 1 times [2023-02-17 02:45:22,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:22,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871564107] [2023-02-17 02:45:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:22,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:22,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871564107] [2023-02-17 02:45:22,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871564107] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:45:22,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:45:22,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:45:22,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407670978] [2023-02-17 02:45:22,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:45:22,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:45:22,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:22,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:45:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:45:22,236 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:22,294 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2023-02-17 02:45:22,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:45:22,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-17 02:45:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:22,295 INFO L225 Difference]: With dead ends: 110 [2023-02-17 02:45:22,296 INFO L226 Difference]: Without dead ends: 110 [2023-02-17 02:45:22,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:45:22,296 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 114 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:22,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 162 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:45:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-17 02:45:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-17 02:45:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 99 states have internal predecessors, (108), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2023-02-17 02:45:22,299 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 37 [2023-02-17 02:45:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:22,299 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2023-02-17 02:45:22,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2023-02-17 02:45:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 02:45:22,300 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:22,300 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] [2023-02-17 02:45:22,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 02:45:22,300 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:22,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash 7143805, now seen corresponding path program 1 times [2023-02-17 02:45:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:22,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021910008] [2023-02-17 02:45:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:22,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:22,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021910008] [2023-02-17 02:45:22,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021910008] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:22,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929285041] [2023-02-17 02:45:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:22,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:22,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:22,389 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-17 02:45:22,391 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-17 02:45:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 02:45:22,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:22,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:22,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929285041] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:45:22,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:45:22,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2023-02-17 02:45:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143621161] [2023-02-17 02:45:22,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:22,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:45:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:22,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:45:22,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:45:22,502 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:22,641 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2023-02-17 02:45:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:45:22,642 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-17 02:45:22,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:22,643 INFO L225 Difference]: With dead ends: 213 [2023-02-17 02:45:22,643 INFO L226 Difference]: Without dead ends: 213 [2023-02-17 02:45:22,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-02-17 02:45:22,644 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 534 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:22,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 592 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:45:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-17 02:45:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 112. [2023-02-17 02:45:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 101 states have internal predecessors, (110), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2023-02-17 02:45:22,646 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 37 [2023-02-17 02:45:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:22,647 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2023-02-17 02:45:22,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2023-02-17 02:45:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 02:45:22,647 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:22,647 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-17 02:45:22,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-17 02:45:22,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:22,848 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash 221416284, now seen corresponding path program 1 times [2023-02-17 02:45:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:22,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537226751] [2023-02-17 02:45:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:22,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537226751] [2023-02-17 02:45:22,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537226751] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:22,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242497303] [2023-02-17 02:45:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:22,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:22,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:22,994 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-17 02:45:22,996 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-17 02:45:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:23,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 02:45:23,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:23,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:23,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-17 02:45:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:23,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242497303] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:45:23,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:45:23,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2023-02-17 02:45:23,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911926831] [2023-02-17 02:45:23,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:23,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 02:45:23,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:23,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 02:45:23,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2023-02-17 02:45:23,221 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 02:45:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:23,667 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2023-02-17 02:45:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 02:45:23,667 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2023-02-17 02:45:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:23,668 INFO L225 Difference]: With dead ends: 160 [2023-02-17 02:45:23,668 INFO L226 Difference]: Without dead ends: 160 [2023-02-17 02:45:23,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=1400, Unknown=0, NotChecked=0, Total=1806 [2023-02-17 02:45:23,669 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 694 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:23,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 453 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:45:23,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-17 02:45:23,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 111. [2023-02-17 02:45:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 100 states have internal predecessors, (109), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:45:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2023-02-17 02:45:23,671 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 38 [2023-02-17 02:45:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:23,672 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2023-02-17 02:45:23,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 02:45:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2023-02-17 02:45:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-17 02:45:23,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:23,672 INFO L195 NwaCegarLoop]: trace histogram [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-17 02:45:23,678 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-17 02:45:23,876 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,SelfDestructingSolverStorable13 [2023-02-17 02:45:23,876 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2034349997, now seen corresponding path program 1 times [2023-02-17 02:45:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:23,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853048367] [2023-02-17 02:45:23,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:24,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:45:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:24,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:45:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:24,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:45:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:45:24,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:24,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853048367] [2023-02-17 02:45:24,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853048367] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:24,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683951021] [2023-02-17 02:45:24,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:24,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:24,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:24,080 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-17 02:45:24,082 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-17 02:45:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:24,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 02:45:24,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:24,219 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 10 treesize of output 9 [2023-02-17 02:45:24,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:45:24,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 40 [2023-02-17 02:45:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 02:45:24,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:25,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683951021] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:25,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:45:25,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2023-02-17 02:45:25,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676338073] [2023-02-17 02:45:25,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:25,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 02:45:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:25,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 02:45:25,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=649, Unknown=1, NotChecked=0, Total=756 [2023-02-17 02:45:25,266 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 7 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:45:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:26,925 INFO L93 Difference]: Finished difference Result 400 states and 432 transitions. [2023-02-17 02:45:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-17 02:45:26,926 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 7 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) Word has length 40 [2023-02-17 02:45:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:26,938 INFO L225 Difference]: With dead ends: 400 [2023-02-17 02:45:26,938 INFO L226 Difference]: Without dead ends: 400 [2023-02-17 02:45:26,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=714, Invalid=2825, Unknown=1, NotChecked=0, Total=3540 [2023-02-17 02:45:26,939 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 2872 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2872 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:26,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2872 Valid, 1013 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 02:45:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-02-17 02:45:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 136. [2023-02-17 02:45:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 105 states have (on average 1.276190476190476) internal successors, (134), 122 states have internal predecessors, (134), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:45:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2023-02-17 02:45:26,943 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 40 [2023-02-17 02:45:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:26,943 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2023-02-17 02:45:26,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 7 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:45:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2023-02-17 02:45:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-17 02:45:26,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:26,944 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, 1, 1, 1, 1] [2023-02-17 02:45:26,948 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-17 02:45:27,148 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,SelfDestructingSolverStorable14 [2023-02-17 02:45:27,148 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:27,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash -804107195, now seen corresponding path program 1 times [2023-02-17 02:45:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:27,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650213479] [2023-02-17 02:45:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:27,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650213479] [2023-02-17 02:45:27,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650213479] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:27,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837466810] [2023-02-17 02:45:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:27,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:27,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:27,233 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-17 02:45:27,235 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-17 02:45:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:45:27,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:27,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:27,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837466810] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:45:27,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:45:27,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 11 [2023-02-17 02:45:27,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916271878] [2023-02-17 02:45:27,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:27,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:45:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:27,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:45:27,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:45:27,334 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:27,497 INFO L93 Difference]: Finished difference Result 290 states and 313 transitions. [2023-02-17 02:45:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 02:45:27,497 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2023-02-17 02:45:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:27,498 INFO L225 Difference]: With dead ends: 290 [2023-02-17 02:45:27,498 INFO L226 Difference]: Without dead ends: 290 [2023-02-17 02:45:27,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2023-02-17 02:45:27,499 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 408 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:27,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 738 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:45:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-02-17 02:45:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 143. [2023-02-17 02:45:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 129 states have internal predecessors, (142), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:45:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2023-02-17 02:45:27,502 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 42 [2023-02-17 02:45:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:27,503 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2023-02-17 02:45:27,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2023-02-17 02:45:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 02:45:27,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:27,504 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, 1, 1, 1, 1, 1] [2023-02-17 02:45:27,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-17 02:45:27,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:27,708 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash 842447236, now seen corresponding path program 1 times [2023-02-17 02:45:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:27,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139752160] [2023-02-17 02:45:27,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:27,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139752160] [2023-02-17 02:45:27,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139752160] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:45:27,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:45:27,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:45:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664684532] [2023-02-17 02:45:27,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:45:27,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:45:27,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:27,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:45:27,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:45:27,768 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:27,822 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2023-02-17 02:45:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:45:27,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2023-02-17 02:45:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:27,824 INFO L225 Difference]: With dead ends: 142 [2023-02-17 02:45:27,824 INFO L226 Difference]: Without dead ends: 142 [2023-02-17 02:45:27,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:45:27,824 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 69 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:27,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 188 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:45:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-17 02:45:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-02-17 02:45:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 128 states have internal predecessors, (141), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:45:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2023-02-17 02:45:27,827 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 43 [2023-02-17 02:45:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:27,828 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2023-02-17 02:45:27,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2023-02-17 02:45:27,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 02:45:27,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:27,828 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, 1, 1, 1, 1, 1] [2023-02-17 02:45:27,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 02:45:27,829 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash 842447237, now seen corresponding path program 1 times [2023-02-17 02:45:27,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:27,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426536743] [2023-02-17 02:45:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:27,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:27,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:27,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426536743] [2023-02-17 02:45:27,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426536743] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:27,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911910014] [2023-02-17 02:45:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:27,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:27,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:27,983 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-17 02:45:27,985 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-17 02:45:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:28,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:45:28,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:28,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:28,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-02-17 02:45:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:28,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911910014] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:45:28,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:45:28,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 17 [2023-02-17 02:45:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694859852] [2023-02-17 02:45:28,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:28,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 02:45:28,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:28,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 02:45:28,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-02-17 02:45:28,127 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 02:45:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:28,542 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2023-02-17 02:45:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 02:45:28,542 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2023-02-17 02:45:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:28,543 INFO L225 Difference]: With dead ends: 225 [2023-02-17 02:45:28,543 INFO L226 Difference]: Without dead ends: 225 [2023-02-17 02:45:28,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 02:45:28,544 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 561 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:28,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 458 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:45:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-17 02:45:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 144. [2023-02-17 02:45:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 114 states have (on average 1.263157894736842) internal successors, (144), 130 states have internal predecessors, (144), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:45:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2023-02-17 02:45:28,547 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 43 [2023-02-17 02:45:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:28,547 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2023-02-17 02:45:28,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 02:45:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2023-02-17 02:45:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 02:45:28,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:28,547 INFO L195 NwaCegarLoop]: trace histogram [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-17 02:45:28,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-17 02:45:28,753 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-17 02:45:28,753 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:28,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:28,753 INFO L85 PathProgramCache]: Analyzing trace with hash 961258010, now seen corresponding path program 1 times [2023-02-17 02:45:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:28,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694273802] [2023-02-17 02:45:28,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:28,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:45:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:28,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:45:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:28,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:45:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:45:28,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:28,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694273802] [2023-02-17 02:45:28,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694273802] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:28,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996789211] [2023-02-17 02:45:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:28,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:28,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:28,860 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-17 02:45:28,890 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-17 02:45:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:28,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 02:45:28,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:45:28,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:29,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-17 02:45:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:45:29,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996789211] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:45:29,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:45:29,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2023-02-17 02:45:29,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387728464] [2023-02-17 02:45:29,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:29,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 02:45:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:29,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 02:45:29,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2023-02-17 02:45:29,047 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 02:45:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:29,555 INFO L93 Difference]: Finished difference Result 397 states and 438 transitions. [2023-02-17 02:45:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 02:45:29,564 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2023-02-17 02:45:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:29,566 INFO L225 Difference]: With dead ends: 397 [2023-02-17 02:45:29,566 INFO L226 Difference]: Without dead ends: 397 [2023-02-17 02:45:29,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 02:45:29,566 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 1554 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:29,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 844 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:45:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-02-17 02:45:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 156. [2023-02-17 02:45:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 126 states have (on average 1.3015873015873016) internal successors, (164), 142 states have internal predecessors, (164), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:45:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2023-02-17 02:45:29,575 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 43 [2023-02-17 02:45:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:29,575 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2023-02-17 02:45:29,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 02:45:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2023-02-17 02:45:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 02:45:29,575 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:29,575 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-02-17 02:45:29,582 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-17 02:45:29,780 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-17 02:45:29,780 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:29,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash -265772755, now seen corresponding path program 1 times [2023-02-17 02:45:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:29,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551267875] [2023-02-17 02:45:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:29,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:45:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:29,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:45:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:45:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:45:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:29,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551267875] [2023-02-17 02:45:29,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551267875] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:29,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913573252] [2023-02-17 02:45:29,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:29,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:29,897 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-17 02:45:29,899 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-17 02:45:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:29,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 02:45:29,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:45:30,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:30,073 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 40 treesize of output 36 [2023-02-17 02:45:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:45:30,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913573252] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:45:30,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:45:30,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-02-17 02:45:30,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777103907] [2023-02-17 02:45:30,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:30,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-17 02:45:30,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:30,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-17 02:45:30,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2023-02-17 02:45:30,127 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:45:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:30,633 INFO L93 Difference]: Finished difference Result 345 states and 389 transitions. [2023-02-17 02:45:30,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 02:45:30,633 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 44 [2023-02-17 02:45:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:30,634 INFO L225 Difference]: With dead ends: 345 [2023-02-17 02:45:30,634 INFO L226 Difference]: Without dead ends: 345 [2023-02-17 02:45:30,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 02:45:30,635 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1055 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:30,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 926 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:45:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-02-17 02:45:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 156. [2023-02-17 02:45:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.2834645669291338) internal successors, (163), 142 states have internal predecessors, (163), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:45:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2023-02-17 02:45:30,638 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 44 [2023-02-17 02:45:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:30,639 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2023-02-17 02:45:30,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:45:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2023-02-17 02:45:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 02:45:30,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:30,639 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:45:30,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 02:45:30,843 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-17 02:45:30,843 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:30,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2137907964, now seen corresponding path program 1 times [2023-02-17 02:45:30,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:30,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892301468] [2023-02-17 02:45:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:30,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:30,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:30,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:30,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:30,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892301468] [2023-02-17 02:45:30,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892301468] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:30,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945286290] [2023-02-17 02:45:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:30,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:30,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:30,942 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-17 02:45:30,943 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-17 02:45:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:31,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 02:45:31,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:31,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:31,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945286290] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:45:31,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:45:31,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2023-02-17 02:45:31,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560297849] [2023-02-17 02:45:31,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:31,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:45:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:31,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:45:31,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:45:31,036 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:31,196 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2023-02-17 02:45:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 02:45:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2023-02-17 02:45:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:31,198 INFO L225 Difference]: With dead ends: 213 [2023-02-17 02:45:31,198 INFO L226 Difference]: Without dead ends: 213 [2023-02-17 02:45:31,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-02-17 02:45:31,199 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 340 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:31,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 443 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:45:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-17 02:45:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 156. [2023-02-17 02:45:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.2755905511811023) internal successors, (162), 142 states have internal predecessors, (162), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:45:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 182 transitions. [2023-02-17 02:45:31,202 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 182 transitions. Word has length 45 [2023-02-17 02:45:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:31,202 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 182 transitions. [2023-02-17 02:45:31,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:45:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 182 transitions. [2023-02-17 02:45:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 02:45:31,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:31,203 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:45:31,207 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-17 02:45:31,407 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-17 02:45:31,407 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1851808460, now seen corresponding path program 1 times [2023-02-17 02:45:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:31,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462745607] [2023-02-17 02:45:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:31,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:31,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:45:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:45:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:45:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:45:31,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:31,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462745607] [2023-02-17 02:45:31,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462745607] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:31,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750010778] [2023-02-17 02:45:31,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:31,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:31,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:31,678 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-17 02:45:31,680 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-17 02:45:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:31,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-17 02:45:31,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:31,786 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-17 02:45:31,813 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 7 treesize of output 6 [2023-02-17 02:45:31,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:45:31,858 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 16 treesize of output 34 [2023-02-17 02:45:31,875 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_339 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_339) |c_#memory_int|)) is different from true [2023-02-17 02:45:31,878 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 13 treesize of output 15 [2023-02-17 02:45:31,896 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 13 treesize of output 15 [2023-02-17 02:45:31,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-02-17 02:45:31,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-02-17 02:45:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-17 02:45:31,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:45:50,063 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_downsweep_~a#1.offset| Int) (|ULTIMATE.start_check_~a#1.offset| Int) (|ULTIMATE.start_check_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |ULTIMATE.start_downsweep_~a#1.offset|) 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4))) 0)) is different from false [2023-02-17 02:45:50,239 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_340 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2023-02-17 02:45:54,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750010778] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:54,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:45:54,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2023-02-17 02:45:54,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977437530] [2023-02-17 02:45:54,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:45:54,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-17 02:45:54,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:45:54,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-17 02:45:54,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=955, Unknown=17, NotChecked=192, Total=1260 [2023-02-17 02:45:54,288 INFO L87 Difference]: Start difference. First operand 156 states and 182 transitions. Second operand has 31 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 6 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-17 02:45:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:45:55,869 INFO L93 Difference]: Finished difference Result 351 states and 384 transitions. [2023-02-17 02:45:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-17 02:45:55,869 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 6 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 46 [2023-02-17 02:45:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:45:55,871 INFO L225 Difference]: With dead ends: 351 [2023-02-17 02:45:55,871 INFO L226 Difference]: Without dead ends: 351 [2023-02-17 02:45:55,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1986 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=1374, Invalid=6452, Unknown=18, NotChecked=528, Total=8372 [2023-02-17 02:45:55,873 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 1878 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1879 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 02:45:55,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1879 Valid, 1046 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1608 Invalid, 0 Unknown, 163 Unchecked, 0.8s Time] [2023-02-17 02:45:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-02-17 02:45:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 174. [2023-02-17 02:45:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 145 states have (on average 1.282758620689655) internal successors, (186), 160 states have internal predecessors, (186), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:45:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2023-02-17 02:45:55,876 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 46 [2023-02-17 02:45:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:45:55,876 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2023-02-17 02:45:55,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 6 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-17 02:45:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2023-02-17 02:45:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 02:45:55,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:45:55,877 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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-17 02:45:55,902 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-17 02:45:56,081 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-17 02:45:56,081 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:45:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:45:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash -895170448, now seen corresponding path program 2 times [2023-02-17 02:45:56,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:45:56,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127060588] [2023-02-17 02:45:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:45:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:45:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:45:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:45:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:56,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:45:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:56,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:45:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:45:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:45:56,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:45:56,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127060588] [2023-02-17 02:45:56,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127060588] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:45:56,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459237384] [2023-02-17 02:45:56,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:45:56,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:45:56,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:45:56,364 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-17 02:45:56,365 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-17 02:45:56,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:45:56,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:45:56,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 02:45:56,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:45:56,492 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 10 treesize of output 9 [2023-02-17 02:45:56,494 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-17 02:45:56,591 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:45:56,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 32 [2023-02-17 02:45:56,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:45:56,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 02:45:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:45:59,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:01,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459237384] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:01,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:46:01,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2023-02-17 02:46:01,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919919085] [2023-02-17 02:46:01,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:01,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 02:46:01,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:01,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 02:46:01,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=923, Unknown=5, NotChecked=0, Total=1056 [2023-02-17 02:46:01,073 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:46:02,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:02,512 INFO L93 Difference]: Finished difference Result 340 states and 390 transitions. [2023-02-17 02:46:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 02:46:02,513 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 46 [2023-02-17 02:46:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:02,513 INFO L225 Difference]: With dead ends: 340 [2023-02-17 02:46:02,514 INFO L226 Difference]: Without dead ends: 340 [2023-02-17 02:46:02,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=442, Invalid=2415, Unknown=5, NotChecked=0, Total=2862 [2023-02-17 02:46:02,514 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1439 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:02,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 1180 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1815 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 02:46:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-02-17 02:46:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 179. [2023-02-17 02:46:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 165 states have internal predecessors, (191), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2023-02-17 02:46:02,518 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 46 [2023-02-17 02:46:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:02,518 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2023-02-17 02:46:02,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:46:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2023-02-17 02:46:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 02:46:02,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:02,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:02,527 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-17 02:46:02,723 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-17 02:46:02,723 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1571491564, now seen corresponding path program 1 times [2023-02-17 02:46:02,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:02,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994687486] [2023-02-17 02:46:02,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:02,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:46:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:46:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:46:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:46:02,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:02,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994687486] [2023-02-17 02:46:02,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994687486] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:46:02,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:46:02,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:46:02,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704494133] [2023-02-17 02:46:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:46:02,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:46:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:02,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:46:02,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:46:02,760 INFO L87 Difference]: Start difference. First operand 179 states and 211 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:02,810 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2023-02-17 02:46:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:46:02,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2023-02-17 02:46:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:02,812 INFO L225 Difference]: With dead ends: 178 [2023-02-17 02:46:02,812 INFO L226 Difference]: Without dead ends: 178 [2023-02-17 02:46:02,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:46:02,815 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 63 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:02,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 196 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:46:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-17 02:46:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2023-02-17 02:46:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 164 states have internal predecessors, (190), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 210 transitions. [2023-02-17 02:46:02,819 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 210 transitions. Word has length 47 [2023-02-17 02:46:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:02,819 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 210 transitions. [2023-02-17 02:46:02,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 210 transitions. [2023-02-17 02:46:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 02:46:02,820 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:02,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:02,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-17 02:46:02,820 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:02,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1571491565, now seen corresponding path program 1 times [2023-02-17 02:46:02,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:02,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922628558] [2023-02-17 02:46:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:02,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:46:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:46:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:46:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:46:02,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:02,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922628558] [2023-02-17 02:46:02,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922628558] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:02,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131703283] [2023-02-17 02:46:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:02,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:02,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:02,918 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-17 02:46:02,920 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-17 02:46:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:02,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:46:02,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:46:03,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:03,039 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 27 treesize of output 23 [2023-02-17 02:46:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:46:03,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131703283] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:03,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:03,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2023-02-17 02:46:03,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943257738] [2023-02-17 02:46:03,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:03,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 02:46:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:03,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 02:46:03,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:46:03,057 INFO L87 Difference]: Start difference. First operand 178 states and 210 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 02:46:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:03,188 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2023-02-17 02:46:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:46:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2023-02-17 02:46:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:03,189 INFO L225 Difference]: With dead ends: 186 [2023-02-17 02:46:03,189 INFO L226 Difference]: Without dead ends: 186 [2023-02-17 02:46:03,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2023-02-17 02:46:03,190 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 313 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:03,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 236 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:46:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-17 02:46:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2023-02-17 02:46:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 168 states have internal predecessors, (195), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2023-02-17 02:46:03,192 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 47 [2023-02-17 02:46:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:03,193 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2023-02-17 02:46:03,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 02:46:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2023-02-17 02:46:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 02:46:03,193 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:03,193 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:03,198 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-17 02:46:03,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:03,394 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2057054475, now seen corresponding path program 1 times [2023-02-17 02:46:03,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:03,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102023463] [2023-02-17 02:46:03,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:03,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:46:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:46:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:03,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:46:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:46:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:03,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102023463] [2023-02-17 02:46:03,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102023463] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:03,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714245647] [2023-02-17 02:46:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:03,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:03,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:03,481 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-17 02:46:03,483 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-17 02:46:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:03,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:46:03,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:46:03,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:46:03,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714245647] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:03,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:03,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2023-02-17 02:46:03,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712015249] [2023-02-17 02:46:03,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:03,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 02:46:03,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:03,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 02:46:03,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:46:03,630 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:03,941 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2023-02-17 02:46:03,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 02:46:03,941 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2023-02-17 02:46:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:03,942 INFO L225 Difference]: With dead ends: 291 [2023-02-17 02:46:03,942 INFO L226 Difference]: Without dead ends: 291 [2023-02-17 02:46:03,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2023-02-17 02:46:03,943 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 801 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:03,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1067 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:46:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-02-17 02:46:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 170. [2023-02-17 02:46:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 142 states have (on average 1.2253521126760563) internal successors, (174), 156 states have internal predecessors, (174), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2023-02-17 02:46:03,946 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 47 [2023-02-17 02:46:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:03,947 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2023-02-17 02:46:03,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2023-02-17 02:46:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 02:46:03,951 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:03,951 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:03,975 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-17 02:46:04,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-17 02:46:04,157 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:04,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:04,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2070871953, now seen corresponding path program 1 times [2023-02-17 02:46:04,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:04,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963619343] [2023-02-17 02:46:04,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:04,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:46:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:04,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:46:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:04,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:46:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:46:04,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:04,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963619343] [2023-02-17 02:46:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963619343] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:04,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022212136] [2023-02-17 02:46:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:04,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:04,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:04,279 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-17 02:46:04,280 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-17 02:46:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:04,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:46:04,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:46:04,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:46:04,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022212136] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:04,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:04,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2023-02-17 02:46:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603030500] [2023-02-17 02:46:04,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:04,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 02:46:04,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:04,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 02:46:04,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-02-17 02:46:04,463 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:04,804 INFO L93 Difference]: Finished difference Result 309 states and 339 transitions. [2023-02-17 02:46:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 02:46:04,804 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2023-02-17 02:46:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:04,805 INFO L225 Difference]: With dead ends: 309 [2023-02-17 02:46:04,805 INFO L226 Difference]: Without dead ends: 309 [2023-02-17 02:46:04,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2023-02-17 02:46:04,806 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 442 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:04,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1693 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:46:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-02-17 02:46:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 190. [2023-02-17 02:46:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 162 states have (on average 1.2222222222222223) internal successors, (198), 176 states have internal predecessors, (198), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2023-02-17 02:46:04,809 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 48 [2023-02-17 02:46:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:04,809 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2023-02-17 02:46:04,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2023-02-17 02:46:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-17 02:46:04,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:04,809 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:04,814 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-17 02:46:05,010 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,SelfDestructingSolverStorable26 [2023-02-17 02:46:05,010 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:05,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1655469456, now seen corresponding path program 1 times [2023-02-17 02:46:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:05,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527968821] [2023-02-17 02:46:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:05,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:05,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:46:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:05,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:46:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:05,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:46:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:46:05,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:05,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527968821] [2023-02-17 02:46:05,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527968821] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:05,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114166001] [2023-02-17 02:46:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:05,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:05,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:05,103 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-17 02:46:05,105 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-17 02:46:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:05,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:46:05,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:46:05,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:46:05,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114166001] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:05,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:05,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2023-02-17 02:46:05,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043179982] [2023-02-17 02:46:05,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:05,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 02:46:05,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:05,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 02:46:05,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:46:05,239 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:05,436 INFO L93 Difference]: Finished difference Result 238 states and 265 transitions. [2023-02-17 02:46:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 02:46:05,437 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2023-02-17 02:46:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:05,438 INFO L225 Difference]: With dead ends: 238 [2023-02-17 02:46:05,438 INFO L226 Difference]: Without dead ends: 238 [2023-02-17 02:46:05,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2023-02-17 02:46:05,439 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 139 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:05,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 758 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:46:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-02-17 02:46:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 195. [2023-02-17 02:46:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 167 states have (on average 1.215568862275449) internal successors, (203), 181 states have internal predecessors, (203), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2023-02-17 02:46:05,442 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 51 [2023-02-17 02:46:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:05,442 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2023-02-17 02:46:05,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2023-02-17 02:46:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-17 02:46:05,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:05,443 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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-17 02:46:05,457 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-17 02:46:05,655 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,SelfDestructingSolverStorable27 [2023-02-17 02:46:05,655 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:05,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1122599580, now seen corresponding path program 3 times [2023-02-17 02:46:05,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:05,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429604720] [2023-02-17 02:46:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:05,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:06,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:46:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:46:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:06,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:46:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 38 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 02:46:06,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:06,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429604720] [2023-02-17 02:46:06,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429604720] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:06,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265362379] [2023-02-17 02:46:06,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:46:06,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:06,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:06,062 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-17 02:46:06,065 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-17 02:46:06,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 02:46:06,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:46:06,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 02:46:06,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:06,154 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-17 02:46:06,157 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-17 02:46:06,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:46:06,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 02:46:06,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 02:46:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-17 02:46:07,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:07,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265362379] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:07,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:46:07,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2023-02-17 02:46:07,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88540146] [2023-02-17 02:46:07,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:07,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 02:46:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 02:46:07,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=824, Unknown=1, NotChecked=0, Total=930 [2023-02-17 02:46:07,342 INFO L87 Difference]: Start difference. First operand 195 states and 223 transitions. Second operand has 26 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:46:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:11,803 INFO L93 Difference]: Finished difference Result 370 states and 408 transitions. [2023-02-17 02:46:11,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-17 02:46:11,803 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 51 [2023-02-17 02:46:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:11,805 INFO L225 Difference]: With dead ends: 370 [2023-02-17 02:46:11,805 INFO L226 Difference]: Without dead ends: 370 [2023-02-17 02:46:11,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=635, Invalid=3024, Unknown=1, NotChecked=0, Total=3660 [2023-02-17 02:46:11,806 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2046 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:11,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2046 Valid, 1235 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-02-17 02:46:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-02-17 02:46:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 193. [2023-02-17 02:46:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 179 states have internal predecessors, (201), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 221 transitions. [2023-02-17 02:46:11,810 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 221 transitions. Word has length 51 [2023-02-17 02:46:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:11,810 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 221 transitions. [2023-02-17 02:46:11,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:46:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 221 transitions. [2023-02-17 02:46:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 02:46:11,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:11,811 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:11,827 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-17 02:46:12,018 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,SelfDestructingSolverStorable28 [2023-02-17 02:46:12,019 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash 589144300, now seen corresponding path program 1 times [2023-02-17 02:46:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:12,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395458418] [2023-02-17 02:46:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:12,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:46:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:46:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:46:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:46:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:12,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395458418] [2023-02-17 02:46:12,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395458418] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:12,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405856528] [2023-02-17 02:46:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:12,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:12,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:12,113 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-17 02:46:12,144 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-17 02:46:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 02:46:12,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:12,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:12,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405856528] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:12,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:12,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2023-02-17 02:46:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545846533] [2023-02-17 02:46:12,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:12,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 02:46:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:12,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 02:46:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:46:12,281 INFO L87 Difference]: Start difference. First operand 193 states and 221 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:12,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:12,498 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2023-02-17 02:46:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 02:46:12,498 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2023-02-17 02:46:12,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:12,499 INFO L225 Difference]: With dead ends: 277 [2023-02-17 02:46:12,499 INFO L226 Difference]: Without dead ends: 277 [2023-02-17 02:46:12,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2023-02-17 02:46:12,500 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 474 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:12,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 757 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:46:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-02-17 02:46:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 183. [2023-02-17 02:46:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 169 states have internal predecessors, (187), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 207 transitions. [2023-02-17 02:46:12,503 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 207 transitions. Word has length 52 [2023-02-17 02:46:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:12,503 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 207 transitions. [2023-02-17 02:46:12,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 207 transitions. [2023-02-17 02:46:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 02:46:12,504 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:12,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:12,521 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-17 02:46:12,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:12,712 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:12,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1768212551, now seen corresponding path program 1 times [2023-02-17 02:46:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:12,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855933770] [2023-02-17 02:46:12,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:12,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:46:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:46:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:46:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:12,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855933770] [2023-02-17 02:46:12,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855933770] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:46:12,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:46:12,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:46:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420101192] [2023-02-17 02:46:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:46:12,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:46:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:12,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:46:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:46:12,751 INFO L87 Difference]: Start difference. First operand 183 states and 207 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:46:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:12,801 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2023-02-17 02:46:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:46:12,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2023-02-17 02:46:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:12,803 INFO L225 Difference]: With dead ends: 182 [2023-02-17 02:46:12,803 INFO L226 Difference]: Without dead ends: 182 [2023-02-17 02:46:12,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:46:12,803 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 108 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:12,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:46:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-17 02:46:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-02-17 02:46:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 156 states have (on average 1.1923076923076923) internal successors, (186), 168 states have internal predecessors, (186), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 206 transitions. [2023-02-17 02:46:12,810 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 206 transitions. Word has length 53 [2023-02-17 02:46:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:12,810 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 206 transitions. [2023-02-17 02:46:12,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:46:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 206 transitions. [2023-02-17 02:46:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 02:46:12,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:12,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:12,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-17 02:46:12,812 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:12,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash -953582912, now seen corresponding path program 1 times [2023-02-17 02:46:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:12,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475823308] [2023-02-17 02:46:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:46:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:46:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:46:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:12,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:12,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475823308] [2023-02-17 02:46:12,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475823308] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:46:12,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:46:12,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:46:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168080071] [2023-02-17 02:46:12,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:46:12,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:46:12,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:12,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:46:12,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:46:12,857 INFO L87 Difference]: Start difference. First operand 182 states and 206 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:46:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:12,902 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2023-02-17 02:46:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:46:12,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2023-02-17 02:46:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:12,903 INFO L225 Difference]: With dead ends: 181 [2023-02-17 02:46:12,904 INFO L226 Difference]: Without dead ends: 181 [2023-02-17 02:46:12,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:46:12,905 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 102 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:12,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 151 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:46:12,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-17 02:46:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-02-17 02:46:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 156 states have (on average 1.185897435897436) internal successors, (185), 167 states have internal predecessors, (185), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2023-02-17 02:46:12,911 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 56 [2023-02-17 02:46:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:12,911 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2023-02-17 02:46:12,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:46:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2023-02-17 02:46:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 02:46:12,912 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:12,912 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:12,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-02-17 02:46:12,912 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:12,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:12,913 INFO L85 PathProgramCache]: Analyzing trace with hash 841059847, now seen corresponding path program 1 times [2023-02-17 02:46:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:12,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339475081] [2023-02-17 02:46:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:46:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:46:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:46:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-17 02:46:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:12,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339475081] [2023-02-17 02:46:12,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339475081] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:46:12,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:46:12,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 02:46:12,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038615481] [2023-02-17 02:46:12,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:46:12,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 02:46:12,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:12,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 02:46:12,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:46:12,985 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:46:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:13,096 INFO L93 Difference]: Finished difference Result 234 states and 262 transitions. [2023-02-17 02:46:13,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:46:13,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2023-02-17 02:46:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:13,097 INFO L225 Difference]: With dead ends: 234 [2023-02-17 02:46:13,097 INFO L226 Difference]: Without dead ends: 234 [2023-02-17 02:46:13,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:46:13,098 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 238 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:13,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 283 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:46:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-17 02:46:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 187. [2023-02-17 02:46:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 162 states have (on average 1.191358024691358) internal successors, (193), 173 states have internal predecessors, (193), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 213 transitions. [2023-02-17 02:46:13,101 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 213 transitions. Word has length 56 [2023-02-17 02:46:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:13,101 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 213 transitions. [2023-02-17 02:46:13,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:46:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 213 transitions. [2023-02-17 02:46:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 02:46:13,101 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:13,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:13,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-02-17 02:46:13,101 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:13,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash 503701003, now seen corresponding path program 1 times [2023-02-17 02:46:13,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:13,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709227690] [2023-02-17 02:46:13,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:13,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:46:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:46:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:46:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:13,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:13,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709227690] [2023-02-17 02:46:13,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709227690] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:46:13,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:46:13,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:46:13,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993952940] [2023-02-17 02:46:13,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:46:13,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:46:13,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:13,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:46:13,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:46:13,177 INFO L87 Difference]: Start difference. First operand 187 states and 213 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:46:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:13,242 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2023-02-17 02:46:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:46:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 57 [2023-02-17 02:46:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:13,243 INFO L225 Difference]: With dead ends: 186 [2023-02-17 02:46:13,243 INFO L226 Difference]: Without dead ends: 186 [2023-02-17 02:46:13,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-02-17 02:46:13,244 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 185 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:13,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 136 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:46:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-17 02:46:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2023-02-17 02:46:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.1851851851851851) internal successors, (192), 172 states have internal predecessors, (192), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:46:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2023-02-17 02:46:13,247 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 57 [2023-02-17 02:46:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:13,247 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2023-02-17 02:46:13,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:46:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2023-02-17 02:46:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-17 02:46:13,248 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:13,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:13,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-17 02:46:13,249 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:13,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1565137885, now seen corresponding path program 1 times [2023-02-17 02:46:13,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:13,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927719760] [2023-02-17 02:46:13,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:13,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 02:46:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-17 02:46:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:46:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:13,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927719760] [2023-02-17 02:46:13,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927719760] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:46:13,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:46:13,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 02:46:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806413490] [2023-02-17 02:46:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:46:13,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 02:46:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 02:46:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:46:13,410 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:46:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:13,524 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2023-02-17 02:46:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:46:13,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2023-02-17 02:46:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:13,525 INFO L225 Difference]: With dead ends: 185 [2023-02-17 02:46:13,525 INFO L226 Difference]: Without dead ends: 144 [2023-02-17 02:46:13,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:46:13,525 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 97 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:13,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 254 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:46:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-17 02:46:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-02-17 02:46:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 124 states have (on average 1.2016129032258065) internal successors, (149), 133 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2023-02-17 02:46:13,528 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 58 [2023-02-17 02:46:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:13,530 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2023-02-17 02:46:13,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:46:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2023-02-17 02:46:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-17 02:46:13,532 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:13,532 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:13,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-02-17 02:46:13,532 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:13,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash 804662856, now seen corresponding path program 1 times [2023-02-17 02:46:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:13,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119507134] [2023-02-17 02:46:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:46:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:46:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:46:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:46:13,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:13,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119507134] [2023-02-17 02:46:13,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119507134] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:13,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903915243] [2023-02-17 02:46:13,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:13,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:13,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:13,822 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-17 02:46:13,824 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-17 02:46:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:13,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 02:46:13,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:14,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:14,206 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 111 treesize of output 105 [2023-02-17 02:46:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:14,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903915243] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:14,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:14,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 40 [2023-02-17 02:46:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825568268] [2023-02-17 02:46:14,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:14,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-17 02:46:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:14,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-17 02:46:14,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2023-02-17 02:46:14,403 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 41 states, 40 states have (on average 2.8) internal successors, (112), 40 states have internal predecessors, (112), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 02:46:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:16,055 INFO L93 Difference]: Finished difference Result 409 states and 456 transitions. [2023-02-17 02:46:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-17 02:46:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.8) internal successors, (112), 40 states have internal predecessors, (112), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 58 [2023-02-17 02:46:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:16,057 INFO L225 Difference]: With dead ends: 409 [2023-02-17 02:46:16,057 INFO L226 Difference]: Without dead ends: 409 [2023-02-17 02:46:16,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1025, Invalid=3945, Unknown=0, NotChecked=0, Total=4970 [2023-02-17 02:46:16,058 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 1721 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:16,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 1017 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-17 02:46:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-02-17 02:46:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 171. [2023-02-17 02:46:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 152 states have (on average 1.230263157894737) internal successors, (187), 160 states have internal predecessors, (187), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2023-02-17 02:46:16,062 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 58 [2023-02-17 02:46:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:16,062 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2023-02-17 02:46:16,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.8) internal successors, (112), 40 states have internal predecessors, (112), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 02:46:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2023-02-17 02:46:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-17 02:46:16,063 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:16,063 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1] [2023-02-17 02:46:16,074 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-17 02:46:16,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-02-17 02:46:16,268 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1522278182, now seen corresponding path program 2 times [2023-02-17 02:46:16,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:16,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861751485] [2023-02-17 02:46:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:16,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:46:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:46:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:46:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:16,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:16,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861751485] [2023-02-17 02:46:16,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861751485] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:16,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060115552] [2023-02-17 02:46:16,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:46:16,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:16,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:16,415 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-17 02:46:16,417 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-17 02:46:16,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:46:16,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:46:16,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 02:46:16,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:16,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:16,643 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 44 treesize of output 40 [2023-02-17 02:46:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:16,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060115552] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:16,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:16,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2023-02-17 02:46:16,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817369940] [2023-02-17 02:46:16,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:16,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-17 02:46:16,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:16,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-17 02:46:16,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 02:46:16,728 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 33 states have internal predecessors, (112), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:46:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:17,286 INFO L93 Difference]: Finished difference Result 272 states and 310 transitions. [2023-02-17 02:46:17,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 02:46:17,286 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 33 states have internal predecessors, (112), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 59 [2023-02-17 02:46:17,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:17,287 INFO L225 Difference]: With dead ends: 272 [2023-02-17 02:46:17,287 INFO L226 Difference]: Without dead ends: 272 [2023-02-17 02:46:17,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=530, Invalid=1726, Unknown=0, NotChecked=0, Total=2256 [2023-02-17 02:46:17,288 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 801 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:17,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 687 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:46:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-02-17 02:46:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 175. [2023-02-17 02:46:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 156 states have (on average 1.2307692307692308) internal successors, (192), 164 states have internal predecessors, (192), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 206 transitions. [2023-02-17 02:46:17,291 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 206 transitions. Word has length 59 [2023-02-17 02:46:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:17,292 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 206 transitions. [2023-02-17 02:46:17,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 33 states have internal predecessors, (112), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:46:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 206 transitions. [2023-02-17 02:46:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-17 02:46:17,292 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:17,293 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:17,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:17,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-02-17 02:46:17,498 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash -812323954, now seen corresponding path program 1 times [2023-02-17 02:46:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:17,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590649057] [2023-02-17 02:46:17,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:17,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:46:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:46:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:17,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:46:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:17,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:17,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590649057] [2023-02-17 02:46:17,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590649057] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:17,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024569444] [2023-02-17 02:46:17,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:17,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:17,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:17,620 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:17,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-17 02:46:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:17,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:46:17,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 02:46:17,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:46:17,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024569444] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:46:17,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:46:17,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 13 [2023-02-17 02:46:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469585346] [2023-02-17 02:46:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:46:17,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:46:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:17,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:46:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:46:17,760 INFO L87 Difference]: Start difference. First operand 175 states and 206 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:17,798 INFO L93 Difference]: Finished difference Result 179 states and 208 transitions. [2023-02-17 02:46:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:46:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2023-02-17 02:46:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:17,800 INFO L225 Difference]: With dead ends: 179 [2023-02-17 02:46:17,800 INFO L226 Difference]: Without dead ends: 179 [2023-02-17 02:46:17,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:46:17,801 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 130 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:17,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 212 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:46:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-17 02:46:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2023-02-17 02:46:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.2278481012658229) internal successors, (194), 166 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 208 transitions. [2023-02-17 02:46:17,804 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 208 transitions. Word has length 60 [2023-02-17 02:46:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:17,804 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 208 transitions. [2023-02-17 02:46:17,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 208 transitions. [2023-02-17 02:46:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-17 02:46:17,805 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:17,805 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1] [2023-02-17 02:46:17,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:18,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-02-17 02:46:18,013 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:18,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 54016621, now seen corresponding path program 1 times [2023-02-17 02:46:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:18,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364021120] [2023-02-17 02:46:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:18,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:18,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:46:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:18,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:46:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:18,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:46:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:18,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:18,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364021120] [2023-02-17 02:46:18,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364021120] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:18,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422565895] [2023-02-17 02:46:18,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:18,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:18,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:18,174 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:18,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-17 02:46:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:18,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 02:46:18,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:18,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:18,429 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 48 treesize of output 44 [2023-02-17 02:46:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:18,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422565895] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:18,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:18,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2023-02-17 02:46:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944547892] [2023-02-17 02:46:18,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:18,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-17 02:46:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:18,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-17 02:46:18,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 02:46:18,540 INFO L87 Difference]: Start difference. First operand 177 states and 208 transitions. Second operand has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 35 states have internal predecessors, (115), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:46:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:19,263 INFO L93 Difference]: Finished difference Result 278 states and 317 transitions. [2023-02-17 02:46:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 02:46:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 35 states have internal predecessors, (115), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 60 [2023-02-17 02:46:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:19,264 INFO L225 Difference]: With dead ends: 278 [2023-02-17 02:46:19,264 INFO L226 Difference]: Without dead ends: 278 [2023-02-17 02:46:19,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=613, Invalid=2039, Unknown=0, NotChecked=0, Total=2652 [2023-02-17 02:46:19,265 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 476 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:19,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1011 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:46:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-02-17 02:46:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 178. [2023-02-17 02:46:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.2264150943396226) internal successors, (195), 167 states have internal predecessors, (195), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 209 transitions. [2023-02-17 02:46:19,269 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 209 transitions. Word has length 60 [2023-02-17 02:46:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:19,269 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 209 transitions. [2023-02-17 02:46:19,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 35 states have internal predecessors, (115), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:46:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 209 transitions. [2023-02-17 02:46:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-17 02:46:19,270 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:19,270 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:46:19,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:19,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:19,476 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1085543347, now seen corresponding path program 1 times [2023-02-17 02:46:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:19,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247613727] [2023-02-17 02:46:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:19,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:19,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:19,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:46:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:46:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:46:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:19,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:19,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247613727] [2023-02-17 02:46:19,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247613727] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:19,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827937445] [2023-02-17 02:46:19,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:19,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:19,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:19,619 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:19,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-02-17 02:46:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:19,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:46:19,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:19,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:19,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827937445] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:19,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:19,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 14 [2023-02-17 02:46:19,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245179349] [2023-02-17 02:46:19,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:19,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 02:46:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:19,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 02:46:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:46:19,802 INFO L87 Difference]: Start difference. First operand 178 states and 209 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:19,932 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2023-02-17 02:46:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:46:19,932 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2023-02-17 02:46:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:19,934 INFO L225 Difference]: With dead ends: 189 [2023-02-17 02:46:19,934 INFO L226 Difference]: Without dead ends: 189 [2023-02-17 02:46:19,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 120 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:46:19,934 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 281 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:19,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 318 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:46:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-02-17 02:46:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 180. [2023-02-17 02:46:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.2236024844720497) internal successors, (197), 169 states have internal predecessors, (197), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 211 transitions. [2023-02-17 02:46:19,937 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 211 transitions. Word has length 63 [2023-02-17 02:46:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:19,937 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 211 transitions. [2023-02-17 02:46:19,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 211 transitions. [2023-02-17 02:46:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-17 02:46:19,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:19,938 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1] [2023-02-17 02:46:19,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:20,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-02-17 02:46:20,151 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:20,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1449216587, now seen corresponding path program 2 times [2023-02-17 02:46:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:20,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959731219] [2023-02-17 02:46:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:20,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:46:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:46:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:20,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:46:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-02-17 02:46:20,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:20,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959731219] [2023-02-17 02:46:20,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959731219] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:20,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857033856] [2023-02-17 02:46:20,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:46:20,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:20,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:20,225 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:20,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-02-17 02:46:20,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:46:20,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:46:20,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 02:46:20,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:20,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:20,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857033856] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:20,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:20,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2023-02-17 02:46:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178418169] [2023-02-17 02:46:20,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:20,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 02:46:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:20,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 02:46:20,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-02-17 02:46:20,437 INFO L87 Difference]: Start difference. First operand 180 states and 211 transitions. Second operand has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:20,759 INFO L93 Difference]: Finished difference Result 230 states and 262 transitions. [2023-02-17 02:46:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 02:46:20,759 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2023-02-17 02:46:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:20,760 INFO L225 Difference]: With dead ends: 230 [2023-02-17 02:46:20,760 INFO L226 Difference]: Without dead ends: 230 [2023-02-17 02:46:20,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 02:46:20,761 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 437 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:20,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1147 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:46:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-17 02:46:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 180. [2023-02-17 02:46:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.2173913043478262) internal successors, (196), 169 states have internal predecessors, (196), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2023-02-17 02:46:20,764 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 63 [2023-02-17 02:46:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:20,764 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2023-02-17 02:46:20,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2023-02-17 02:46:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-17 02:46:20,765 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:20,765 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2023-02-17 02:46:20,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:20,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2023-02-17 02:46:20,970 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:20,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:20,970 INFO L85 PathProgramCache]: Analyzing trace with hash -560989999, now seen corresponding path program 3 times [2023-02-17 02:46:20,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:20,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661287662] [2023-02-17 02:46:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:20,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:21,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:21,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:46:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:46:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:21,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:46:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:46:21,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:21,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661287662] [2023-02-17 02:46:21,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661287662] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:21,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151931286] [2023-02-17 02:46:21,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:46:21,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:21,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:21,114 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:21,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-17 02:46:21,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 02:46:21,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:46:21,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 02:46:21,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-17 02:46:21,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-17 02:46:21,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151931286] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:21,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:21,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 28 [2023-02-17 02:46:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162458703] [2023-02-17 02:46:21,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:21,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 02:46:21,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:21,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 02:46:21,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2023-02-17 02:46:21,441 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:22,223 INFO L93 Difference]: Finished difference Result 354 states and 407 transitions. [2023-02-17 02:46:22,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-17 02:46:22,223 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2023-02-17 02:46:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:22,224 INFO L225 Difference]: With dead ends: 354 [2023-02-17 02:46:22,224 INFO L226 Difference]: Without dead ends: 354 [2023-02-17 02:46:22,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=677, Invalid=2863, Unknown=0, NotChecked=0, Total=3540 [2023-02-17 02:46:22,226 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1053 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:22,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 503 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:46:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-02-17 02:46:22,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 198. [2023-02-17 02:46:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 179 states have (on average 1.1899441340782122) internal successors, (213), 187 states have internal predecessors, (213), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 227 transitions. [2023-02-17 02:46:22,229 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 227 transitions. Word has length 64 [2023-02-17 02:46:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:22,230 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 227 transitions. [2023-02-17 02:46:22,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 227 transitions. [2023-02-17 02:46:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 02:46:22,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:22,231 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 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-17 02:46:22,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:22,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-02-17 02:46:22,445 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash -593864845, now seen corresponding path program 1 times [2023-02-17 02:46:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:22,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215787217] [2023-02-17 02:46:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:22,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:22,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:46:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:22,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:46:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:22,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:46:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:22,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:22,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215787217] [2023-02-17 02:46:22,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215787217] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:22,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104584364] [2023-02-17 02:46:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:22,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:22,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:22,565 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:22,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-02-17 02:46:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:22,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:46:22,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:22,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:22,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104584364] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:22,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:22,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2023-02-17 02:46:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326324687] [2023-02-17 02:46:22,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:22,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 02:46:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:22,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 02:46:22,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2023-02-17 02:46:22,783 INFO L87 Difference]: Start difference. First operand 198 states and 227 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:22,972 INFO L93 Difference]: Finished difference Result 238 states and 270 transitions. [2023-02-17 02:46:22,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 02:46:22,973 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2023-02-17 02:46:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:22,974 INFO L225 Difference]: With dead ends: 238 [2023-02-17 02:46:22,974 INFO L226 Difference]: Without dead ends: 238 [2023-02-17 02:46:22,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 114 SyntacticMatches, 16 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2023-02-17 02:46:22,974 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 180 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:22,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 704 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:46:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-02-17 02:46:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 216. [2023-02-17 02:46:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 197 states have (on average 1.1827411167512691) internal successors, (233), 205 states have internal predecessors, (233), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 247 transitions. [2023-02-17 02:46:22,983 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 247 transitions. Word has length 65 [2023-02-17 02:46:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:22,986 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 247 transitions. [2023-02-17 02:46:22,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 247 transitions. [2023-02-17 02:46:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-17 02:46:22,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:22,987 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2023-02-17 02:46:22,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:23,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:23,191 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:23,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1365247444, now seen corresponding path program 3 times [2023-02-17 02:46:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:23,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138354842] [2023-02-17 02:46:23,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:23,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:46:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:23,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:46:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:23,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:46:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-17 02:46:23,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:23,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138354842] [2023-02-17 02:46:23,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138354842] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:23,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380989042] [2023-02-17 02:46:23,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:46:23,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:23,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:23,374 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:23,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-02-17 02:46:23,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 02:46:23,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:46:23,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-17 02:46:23,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-17 02:46:25,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:26,122 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 46 [2023-02-17 02:46:26,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380989042] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:26,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:46:26,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-02-17 02:46:26,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102394323] [2023-02-17 02:46:26,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:26,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 02:46:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:26,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 02:46:26,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 02:46:26,254 INFO L87 Difference]: Start difference. First operand 216 states and 247 transitions. Second operand has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-17 02:46:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:35,275 INFO L93 Difference]: Finished difference Result 384 states and 427 transitions. [2023-02-17 02:46:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-17 02:46:35,277 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 68 [2023-02-17 02:46:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:35,278 INFO L225 Difference]: With dead ends: 384 [2023-02-17 02:46:35,278 INFO L226 Difference]: Without dead ends: 384 [2023-02-17 02:46:35,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=622, Invalid=3037, Unknown=1, NotChecked=0, Total=3660 [2023-02-17 02:46:35,278 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 1525 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:35,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1529 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-02-17 02:46:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-02-17 02:46:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 218. [2023-02-17 02:46:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 199 states have (on average 1.1809045226130652) internal successors, (235), 207 states have internal predecessors, (235), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 249 transitions. [2023-02-17 02:46:35,285 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 249 transitions. Word has length 68 [2023-02-17 02:46:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:35,285 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 249 transitions. [2023-02-17 02:46:35,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-17 02:46:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 249 transitions. [2023-02-17 02:46:35,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-17 02:46:35,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:35,287 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1] [2023-02-17 02:46:35,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:35,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:35,487 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash -767754326, now seen corresponding path program 2 times [2023-02-17 02:46:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:35,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57290149] [2023-02-17 02:46:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:35,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:35,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:46:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:35,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:46:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:35,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:46:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-17 02:46:35,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:35,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57290149] [2023-02-17 02:46:35,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57290149] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:35,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698850449] [2023-02-17 02:46:35,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:46:35,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:35,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:35,646 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:35,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-02-17 02:46:35,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:46:35,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:46:35,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:46:35,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:46:36,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 62 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:46:36,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698850449] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:36,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:36,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2023-02-17 02:46:36,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84638252] [2023-02-17 02:46:36,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:36,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-17 02:46:36,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:36,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-17 02:46:36,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 02:46:36,535 INFO L87 Difference]: Start difference. First operand 218 states and 249 transitions. Second operand has 36 states, 36 states have (on average 3.888888888888889) internal successors, (140), 35 states have internal predecessors, (140), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-17 02:46:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:37,749 INFO L93 Difference]: Finished difference Result 419 states and 483 transitions. [2023-02-17 02:46:37,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-17 02:46:37,750 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.888888888888889) internal successors, (140), 35 states have internal predecessors, (140), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2023-02-17 02:46:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:37,751 INFO L225 Difference]: With dead ends: 419 [2023-02-17 02:46:37,751 INFO L226 Difference]: Without dead ends: 419 [2023-02-17 02:46:37,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=811, Invalid=2971, Unknown=0, NotChecked=0, Total=3782 [2023-02-17 02:46:37,752 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1673 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:37,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1014 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 02:46:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-02-17 02:46:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 251. [2023-02-17 02:46:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 232 states have (on average 1.1939655172413792) internal successors, (277), 240 states have internal predecessors, (277), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 291 transitions. [2023-02-17 02:46:37,756 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 291 transitions. Word has length 70 [2023-02-17 02:46:37,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:37,756 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 291 transitions. [2023-02-17 02:46:37,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.888888888888889) internal successors, (140), 35 states have internal predecessors, (140), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-17 02:46:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 291 transitions. [2023-02-17 02:46:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-17 02:46:37,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:37,757 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-17 02:46:37,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:37,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:37,975 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2098065761, now seen corresponding path program 1 times [2023-02-17 02:46:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:37,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793335218] [2023-02-17 02:46:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:37,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:46:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:46:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:46:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 02:46:39,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:39,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793335218] [2023-02-17 02:46:39,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793335218] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:39,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310208276] [2023-02-17 02:46:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:39,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:39,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:39,424 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:39,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-02-17 02:46:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:39,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 81 conjunts are in the unsatisfiable core [2023-02-17 02:46:39,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:39,904 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 17 treesize of output 13 [2023-02-17 02:46:40,116 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:46:40,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2023-02-17 02:46:40,201 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 15 treesize of output 11 [2023-02-17 02:46:40,290 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 23 treesize of output 7 [2023-02-17 02:46:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:46:40,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:40,460 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 48 treesize of output 40 [2023-02-17 02:46:40,813 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 26 treesize of output 24 [2023-02-17 02:46:40,816 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 56 treesize of output 44 [2023-02-17 02:46:40,830 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 02:46:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:46:41,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310208276] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:41,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:41,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 21] total 64 [2023-02-17 02:46:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274197223] [2023-02-17 02:46:41,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:41,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-02-17 02:46:41,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:41,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-02-17 02:46:41,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3813, Unknown=0, NotChecked=0, Total=4032 [2023-02-17 02:46:41,370 INFO L87 Difference]: Start difference. First operand 251 states and 291 transitions. Second operand has 64 states, 62 states have (on average 2.3870967741935485) internal successors, (148), 62 states have internal predecessors, (148), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-17 02:46:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:50,118 INFO L93 Difference]: Finished difference Result 328 states and 371 transitions. [2023-02-17 02:46:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-02-17 02:46:50,118 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 62 states have (on average 2.3870967741935485) internal successors, (148), 62 states have internal predecessors, (148), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 72 [2023-02-17 02:46:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:50,119 INFO L225 Difference]: With dead ends: 328 [2023-02-17 02:46:50,119 INFO L226 Difference]: Without dead ends: 328 [2023-02-17 02:46:50,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 113 SyntacticMatches, 10 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3195 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1584, Invalid=13422, Unknown=0, NotChecked=0, Total=15006 [2023-02-17 02:46:50,121 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1327 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:50,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 1004 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-02-17 02:46:50,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-02-17 02:46:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 256. [2023-02-17 02:46:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 237 states have (on average 1.1898734177215189) internal successors, (282), 245 states have internal predecessors, (282), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2023-02-17 02:46:50,124 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 72 [2023-02-17 02:46:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:50,125 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2023-02-17 02:46:50,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 62 states have (on average 2.3870967741935485) internal successors, (148), 62 states have internal predecessors, (148), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-17 02:46:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2023-02-17 02:46:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-02-17 02:46:50,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:50,125 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2023-02-17 02:46:50,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:50,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-02-17 02:46:50,331 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2081136393, now seen corresponding path program 4 times [2023-02-17 02:46:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:50,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653644123] [2023-02-17 02:46:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:50,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:46:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:46:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:50,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:46:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 02:46:50,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:50,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653644123] [2023-02-17 02:46:50,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653644123] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:50,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542761926] [2023-02-17 02:46:50,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 02:46:50,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:50,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:50,486 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:50,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-02-17 02:46:50,576 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 02:46:50,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:46:50,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 02:46:50,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 18 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-17 02:46:50,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-17 02:46:50,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542761926] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:50,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:50,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 25 [2023-02-17 02:46:50,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954905851] [2023-02-17 02:46:50,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:50,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 02:46:50,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:50,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 02:46:50,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2023-02-17 02:46:50,824 INFO L87 Difference]: Start difference. First operand 256 states and 296 transitions. Second operand has 25 states, 25 states have (on average 4.08) internal successors, (102), 24 states have internal predecessors, (102), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:51,089 INFO L93 Difference]: Finished difference Result 381 states and 431 transitions. [2023-02-17 02:46:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 02:46:51,089 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.08) internal successors, (102), 24 states have internal predecessors, (102), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2023-02-17 02:46:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:51,090 INFO L225 Difference]: With dead ends: 381 [2023-02-17 02:46:51,090 INFO L226 Difference]: Without dead ends: 381 [2023-02-17 02:46:51,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 107 SyntacticMatches, 36 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 02:46:51,090 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 978 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:51,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 917 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:46:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-02-17 02:46:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 246. [2023-02-17 02:46:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 227 states have (on average 1.1806167400881058) internal successors, (268), 235 states have internal predecessors, (268), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2023-02-17 02:46:51,094 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 73 [2023-02-17 02:46:51,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:51,094 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2023-02-17 02:46:51,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.08) internal successors, (102), 24 states have internal predecessors, (102), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2023-02-17 02:46:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-02-17 02:46:51,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:51,095 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 1, 1] [2023-02-17 02:46:51,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:51,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-02-17 02:46:51,300 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1899956778, now seen corresponding path program 3 times [2023-02-17 02:46:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:51,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450657216] [2023-02-17 02:46:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:51,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:51,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:51,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:46:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:46:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:46:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 38 proven. 54 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:46:51,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:51,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450657216] [2023-02-17 02:46:51,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450657216] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:51,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524607254] [2023-02-17 02:46:51,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:46:51,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:51,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:51,511 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:51,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-02-17 02:46:51,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 02:46:51,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:46:51,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 02:46:51,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-02-17 02:46:52,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:52,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-02-17 02:46:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-02-17 02:46:52,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524607254] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:52,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:52,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 38 [2023-02-17 02:46:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180902453] [2023-02-17 02:46:52,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:52,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-17 02:46:52,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-17 02:46:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2023-02-17 02:46:52,890 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 39 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 38 states have internal predecessors, (130), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-17 02:46:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:57,064 INFO L93 Difference]: Finished difference Result 405 states and 459 transitions. [2023-02-17 02:46:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-02-17 02:46:57,064 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 38 states have internal predecessors, (130), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 75 [2023-02-17 02:46:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:57,065 INFO L225 Difference]: With dead ends: 405 [2023-02-17 02:46:57,065 INFO L226 Difference]: Without dead ends: 405 [2023-02-17 02:46:57,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1744, Invalid=6266, Unknown=0, NotChecked=0, Total=8010 [2023-02-17 02:46:57,066 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 900 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:57,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1195 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2110 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-17 02:46:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-02-17 02:46:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 266. [2023-02-17 02:46:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 247 states have (on average 1.1821862348178138) internal successors, (292), 255 states have internal predecessors, (292), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2023-02-17 02:46:57,070 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 75 [2023-02-17 02:46:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:57,071 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2023-02-17 02:46:57,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 38 states have internal predecessors, (130), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-17 02:46:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2023-02-17 02:46:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-02-17 02:46:57,072 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:57,072 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2023-02-17 02:46:57,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:57,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:57,278 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:57,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1481214108, now seen corresponding path program 1 times [2023-02-17 02:46:57,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:57,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456849702] [2023-02-17 02:46:57,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:57,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:46:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:57,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 02:46:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:57,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:46:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 54 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 02:46:57,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:57,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456849702] [2023-02-17 02:46:57,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456849702] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:57,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642263958] [2023-02-17 02:46:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:57,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:57,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:57,445 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:57,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-02-17 02:46:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:57,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 02:46:57,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:46:57,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:46:57,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642263958] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:57,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:57,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 20 [2023-02-17 02:46:57,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542075801] [2023-02-17 02:46:57,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:57,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 02:46:57,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:57,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 02:46:57,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:46:57,745 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand has 20 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:58,029 INFO L93 Difference]: Finished difference Result 364 states and 408 transitions. [2023-02-17 02:46:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 02:46:58,029 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2023-02-17 02:46:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:58,030 INFO L225 Difference]: With dead ends: 364 [2023-02-17 02:46:58,030 INFO L226 Difference]: Without dead ends: 364 [2023-02-17 02:46:58,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 117 SyntacticMatches, 36 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 02:46:58,031 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 706 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:58,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 903 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:46:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-02-17 02:46:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 258. [2023-02-17 02:46:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 239 states have (on average 1.1715481171548117) internal successors, (280), 247 states have internal predecessors, (280), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 294 transitions. [2023-02-17 02:46:58,034 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 294 transitions. Word has length 75 [2023-02-17 02:46:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:58,034 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 294 transitions. [2023-02-17 02:46:58,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 02:46:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 294 transitions. [2023-02-17 02:46:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-17 02:46:58,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:58,035 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:58,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:58,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-02-17 02:46:58,249 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:58,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:58,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1833874459, now seen corresponding path program 1 times [2023-02-17 02:46:58,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:58,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40070992] [2023-02-17 02:46:58,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:58,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:46:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:46:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:58,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:46:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:58,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:46:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 02:46:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:46:58,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40070992] [2023-02-17 02:46:58,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40070992] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:46:58,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443998055] [2023-02-17 02:46:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:58,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:46:58,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:46:58,505 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:46:58,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-02-17 02:46:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:46:58,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 02:46:58,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:46:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 02:46:58,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:46:58,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-17 02:46:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 02:46:58,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443998055] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:46:58,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:46:58,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 28 [2023-02-17 02:46:58,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847683775] [2023-02-17 02:46:58,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:46:58,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 02:46:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:46:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 02:46:58,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2023-02-17 02:46:58,795 INFO L87 Difference]: Start difference. First operand 258 states and 294 transitions. Second operand has 29 states, 28 states have (on average 6.107142857142857) internal successors, (171), 28 states have internal predecessors, (171), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:46:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:46:59,140 INFO L93 Difference]: Finished difference Result 273 states and 308 transitions. [2023-02-17 02:46:59,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 02:46:59,141 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 6.107142857142857) internal successors, (171), 28 states have internal predecessors, (171), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 77 [2023-02-17 02:46:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:46:59,142 INFO L225 Difference]: With dead ends: 273 [2023-02-17 02:46:59,142 INFO L226 Difference]: Without dead ends: 273 [2023-02-17 02:46:59,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2023-02-17 02:46:59,142 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 487 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:46:59,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 378 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:46:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-17 02:46:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 262. [2023-02-17 02:46:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 243 states have (on average 1.168724279835391) internal successors, (284), 251 states have internal predecessors, (284), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:46:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 298 transitions. [2023-02-17 02:46:59,147 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 298 transitions. Word has length 77 [2023-02-17 02:46:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:46:59,148 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 298 transitions. [2023-02-17 02:46:59,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 6.107142857142857) internal successors, (171), 28 states have internal predecessors, (171), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-17 02:46:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 298 transitions. [2023-02-17 02:46:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-17 02:46:59,149 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:46:59,149 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:59,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-02-17 02:46:59,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-02-17 02:46:59,353 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-17 02:46:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:46:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash 970084470, now seen corresponding path program 1 times [2023-02-17 02:46:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:46:59,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004898220] [2023-02-17 02:46:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:46:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:46:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:47:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:47:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:47:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 02:47:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:47:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 02:47:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:47:01,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:47:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:47:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 02:47:01,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:47:01,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004898220] [2023-02-17 02:47:01,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004898220] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:47:01,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740872658] [2023-02-17 02:47:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:47:01,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:47:01,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:47:01,648 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:47:01,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-02-17 02:47:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:47:01,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 142 conjunts are in the unsatisfiable core [2023-02-17 02:47:01,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:47:01,959 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-17 02:47:02,018 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 7 treesize of output 6 [2023-02-17 02:47:02,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:47:02,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 02:47:02,152 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 10 [2023-02-17 02:47:02,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2023-02-17 02:47:02,180 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 02:47:02,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 100 [2023-02-17 02:47:02,337 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 02:47:02,339 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 02:47:02,343 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 ((as const (Array Int Int)) 0)) (.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~1#1|) (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (= .cse2 .cse0) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse2 .cse3) 0) (= (select .cse2 (@diff .cse2 .cse2)) 0) (exists ((v_ArrVal_1207 Int)) (= (store .cse2 .cse3 v_ArrVal_1207) .cse4))) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse5 (@diff v_arrayElimCell_44 .cse2))) (and (= (select v_arrayElimCell_44 .cse3) 0) (= .cse2 (store v_arrayElimCell_44 .cse5 0)) (= (select v_arrayElimCell_44 .cse5) 0) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~1#1| |c_ULTIMATE.start_main_~n~0#1|) (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |c_ULTIMATE.start_main_~i~1#1|)))) is different from false [2023-02-17 02:47:02,345 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 ((as const (Array Int Int)) 0)) (.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~1#1|) (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (= .cse2 .cse0) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse2 .cse3) 0) (= (select .cse2 (@diff .cse2 .cse2)) 0) (exists ((v_ArrVal_1207 Int)) (= (store .cse2 .cse3 v_ArrVal_1207) .cse4))) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse5 (@diff v_arrayElimCell_44 .cse2))) (and (= (select v_arrayElimCell_44 .cse3) 0) (= .cse2 (store v_arrayElimCell_44 .cse5 0)) (= (select v_arrayElimCell_44 .cse5) 0) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~1#1| |c_ULTIMATE.start_main_~n~0#1|) (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |c_ULTIMATE.start_main_~i~1#1|)))) is different from true [2023-02-17 02:47:02,358 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse3 (+ (- 1) |c_ULTIMATE.start_main_~i~1#1|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse6 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse6))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse1) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= .cse4 (store .cse0 .cse1 v_ArrVal_1207)) (= (select .cse5 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse7 (@diff v_arrayElimCell_44 .cse0)) (.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (= .cse0 (store v_arrayElimCell_44 .cse7 0)) (= (select v_arrayElimCell_44 .cse8) 0) (= (select v_arrayElimCell_44 .cse7) 0) (= (store v_arrayElimCell_44 .cse8 v_ArrVal_1207) .cse4)))) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= (select .cse5 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 .cse5) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-17 02:47:02,360 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse3 (+ (- 1) |c_ULTIMATE.start_main_~i~1#1|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse6 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse6))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse1) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= .cse4 (store .cse0 .cse1 v_ArrVal_1207)) (= (select .cse5 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse7 (@diff v_arrayElimCell_44 .cse0)) (.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (= .cse0 (store v_arrayElimCell_44 .cse7 0)) (= (select v_arrayElimCell_44 .cse8) 0) (= (select v_arrayElimCell_44 .cse7) 0) (= (store v_arrayElimCell_44 .cse8 v_ArrVal_1207) .cse4)))) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= (select .cse5 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 .cse5) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-17 02:47:02,370 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-17 02:47:02,372 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-17 02:47:02,390 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from false [2023-02-17 02:47:02,393 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from true [2023-02-17 02:47:02,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) |c_ULTIMATE.start_upsweep_~left~0#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from false [2023-02-17 02:47:02,417 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) |c_ULTIMATE.start_upsweep_~left~0#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from true [2023-02-17 02:47:02,427 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) (+ (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) |c_ULTIMATE.start_upsweep_~right~0#1|)) (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from false [2023-02-17 02:47:02,430 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) (+ (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) |c_ULTIMATE.start_upsweep_~right~0#1|)) (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from true [2023-02-17 02:47:02,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 153 [2023-02-17 02:47:02,457 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from false [2023-02-17 02:47:02,459 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from true [2023-02-17 02:47:02,479 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_upsweep_~space~0#1| (* 2 1)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-17 02:47:02,482 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_upsweep_~space~0#1| (* 2 1)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-17 02:47:02,497 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_upsweep_#res#1| (* 2 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-17 02:47:02,499 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_upsweep_#res#1| (* 2 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-17 02:47:02,510 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse3 (+ |c_ULTIMATE.start_downsweep_~n#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse1) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (< v_prenex_6 |c_ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store .cse0 .cse1 v_prenex_7)) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_downsweep_~n#1|) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (select v_arrayElimCell_44 .cse5) 0) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse2) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1)))) is different from false [2023-02-17 02:47:02,513 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse3 (+ |c_ULTIMATE.start_downsweep_~n#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse1) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (< v_prenex_6 |c_ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store .cse0 .cse1 v_prenex_7)) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_downsweep_~n#1|) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (select v_arrayElimCell_44 .cse5) 0) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse2) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1)))) is different from true [2023-02-17 02:47:02,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 164 [2023-02-17 02:47:02,541 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1))) is different from false [2023-02-17 02:47:02,545 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1))) is different from true [2023-02-17 02:47:02,567 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-17 02:47:02,570 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from true [2023-02-17 02:47:02,593 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (> |c_ULTIMATE.start_downsweep_~space#1| 0) (= |c_ULTIMATE.start_downsweep_~right~1#1| (+ (- 1) (* |c_ULTIMATE.start_downsweep_~space#1| 2))) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-17 02:47:02,596 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (> |c_ULTIMATE.start_downsweep_~space#1| 0) (= |c_ULTIMATE.start_downsweep_~right~1#1| (+ (- 1) (* |c_ULTIMATE.start_downsweep_~space#1| 2))) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from true [2023-02-17 02:47:02,619 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-17 02:47:02,623 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-17 02:47:02,652 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|) (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_#t~mem7#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-17 02:47:02,656 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|) (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_#t~mem7#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-17 02:47:02,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|) (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-17 02:47:02,682 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|) (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-17 02:47:02,707 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse11 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (= |c_ULTIMATE.start_downsweep_#t~mem8#1| (select .cse0 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (- 1) 1)) (.cse8 (* (- 1) 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (@diff v_arrayElimCell_44 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse2 0)) (= (select v_arrayElimCell_44 .cse3) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse2) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse1 .cse9) 0) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse4 (store .cse1 .cse9 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse11 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse11)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse11 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-17 02:47:02,710 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse11 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (= |c_ULTIMATE.start_downsweep_#t~mem8#1| (select .cse0 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (- 1) 1)) (.cse8 (* (- 1) 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (@diff v_arrayElimCell_44 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse2 0)) (= (select v_arrayElimCell_44 .cse3) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse2) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse1 .cse9) 0) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse4 (store .cse1 .cse9 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse11 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse11)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse11 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-17 02:47:02,733 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|))) (let ((.cse11 (select .cse0 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (.cse12 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (= |c_ULTIMATE.start_downsweep_#t~mem8#1| (select .cse0 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (- 1) 1)) (.cse8 (* (- 1) 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (@diff v_arrayElimCell_44 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse2 0)) (= (select v_arrayElimCell_44 .cse3) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse2) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse1 .cse9) 0) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse4 (store .cse1 .cse9 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= .cse11 |c_ULTIMATE.start_downsweep_#t~mem9#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse11 |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse12 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse12)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse12 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-02-17 02:47:02,737 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|))) (let ((.cse11 (select .cse0 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (.cse12 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (= |c_ULTIMATE.start_downsweep_#t~mem8#1| (select .cse0 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (- 1) 1)) (.cse8 (* (- 1) 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (@diff v_arrayElimCell_44 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse2 0)) (= (select v_arrayElimCell_44 .cse3) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse2) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse1 .cse9) 0) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse4 (store .cse1 .cse9 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= .cse11 |c_ULTIMATE.start_downsweep_#t~mem9#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse11 |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse12 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse12)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse12 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from true [2023-02-17 02:47:02,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 244 [2023-02-17 02:47:02,769 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 |c_ULTIMATE.start_downsweep_~left~1#1|))) (let ((.cse1 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) .cse0))) (and (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 (+ (- 1) (* .cse1 2))) (> .cse1 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse5 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (+ (- 1) 1)) (.cse11 (* (- 1) 1)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse4 (+ (* .cse0 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse7 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse13 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|)) (.cse3 (store (store .cse7 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse7)) (.cse6 (select .cse3 .cse4)) (.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse13))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store .cse3 .cse4 (+ (select .cse3 .cse5) .cse6))) (= .cse7 (store v_arrayElimCell_44 .cse8 0)) (= (select v_arrayElimCell_44 .cse9) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (= .cse6 |c_ULTIMATE.start_downsweep_~temp~0#1|) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse10 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse11)) (= (store v_arrayElimCell_44 .cse9 v_ArrVal_1207) .cse12) (= (select .cse7 (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))) (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse17 (* v_prenex_6 4)) (.cse14 (store (store .cse7 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse15 (select .cse14 .cse4)) (.cse16 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (= (store .cse14 .cse4 (+ (select .cse14 .cse5) .cse15)) .cse2) (= |c_ULTIMATE.start_downsweep_~temp~0#1| .cse15) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse7 .cse16) 0) (< v_prenex_6 v_prenex_10) (<= .cse10 (+ .cse11 v_prenex_8)) (= .cse12 (store .cse7 .cse16 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse7 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))))))) is different from false [2023-02-17 02:47:02,773 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 |c_ULTIMATE.start_downsweep_~left~1#1|))) (let ((.cse1 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) .cse0))) (and (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 (+ (- 1) (* .cse1 2))) (> .cse1 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse5 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (+ (- 1) 1)) (.cse11 (* (- 1) 1)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse4 (+ (* .cse0 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse7 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse13 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|)) (.cse3 (store (store .cse7 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse7)) (.cse6 (select .cse3 .cse4)) (.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse13))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store .cse3 .cse4 (+ (select .cse3 .cse5) .cse6))) (= .cse7 (store v_arrayElimCell_44 .cse8 0)) (= (select v_arrayElimCell_44 .cse9) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (= .cse6 |c_ULTIMATE.start_downsweep_~temp~0#1|) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse10 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse11)) (= (store v_arrayElimCell_44 .cse9 v_ArrVal_1207) .cse12) (= (select .cse7 (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))) (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse17 (* v_prenex_6 4)) (.cse14 (store (store .cse7 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse15 (select .cse14 .cse4)) (.cse16 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (= (store .cse14 .cse4 (+ (select .cse14 .cse5) .cse15)) .cse2) (= |c_ULTIMATE.start_downsweep_~temp~0#1| .cse15) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse7 .cse16) 0) (< v_prenex_6 v_prenex_10) (<= .cse10 (+ .cse11 v_prenex_8)) (= .cse12 (store .cse7 .cse16 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse7 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))))))) is different from true [2023-02-17 02:47:02,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 395 treesize of output 389 [2023-02-17 02:47:02,811 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 0 1))) (and (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 0))) (.cse6 (+ (* .cse16 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ (- 1) 1)) (.cse3 (* (- 1) 1)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse0 .cse1) 0) (< v_prenex_6 v_prenex_10) (<= .cse2 (+ .cse3 v_prenex_8)) (= .cse4 (let ((.cse5 (store (store .cse0 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse7 (select .cse5 .cse6))) (store (store .cse5 .cse6 (+ .cse7 (select .cse5 .cse8))) .cse8 .cse7)))) (= .cse9 (store .cse0 .cse1 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse0 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (@diff v_arrayElimCell_44 .cse0)) (.cse12 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse11 0)) (= (select v_arrayElimCell_44 .cse12) 0) (= .cse4 (let ((.cse13 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse14 (select .cse13 .cse6))) (store (store .cse13 .cse6 (+ (select .cse13 .cse8) .cse14)) .cse8 .cse14)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse11) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse2 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse3)) (= (store v_arrayElimCell_44 .cse12 v_ArrVal_1207) .cse9) (= (select .cse0 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))))) (> (+ .cse16 (* (- 1) 0)) 0) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-17 02:47:02,815 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 0 1))) (and (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 0))) (.cse6 (+ (* .cse16 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ (- 1) 1)) (.cse3 (* (- 1) 1)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse0 .cse1) 0) (< v_prenex_6 v_prenex_10) (<= .cse2 (+ .cse3 v_prenex_8)) (= .cse4 (let ((.cse5 (store (store .cse0 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse7 (select .cse5 .cse6))) (store (store .cse5 .cse6 (+ .cse7 (select .cse5 .cse8))) .cse8 .cse7)))) (= .cse9 (store .cse0 .cse1 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse0 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (@diff v_arrayElimCell_44 .cse0)) (.cse12 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse11 0)) (= (select v_arrayElimCell_44 .cse12) 0) (= .cse4 (let ((.cse13 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse14 (select .cse13 .cse6))) (store (store .cse13 .cse6 (+ (select .cse13 .cse8) .cse14)) .cse8 .cse14)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse11) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse2 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse3)) (= (store v_arrayElimCell_44 .cse12 v_ArrVal_1207) .cse9) (= (select .cse0 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))))) (> (+ .cse16 (* (- 1) 0)) 0) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-17 02:47:02,877 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 0 1))) (and (not (= |c_ULTIMATE.start_check_~a0#1.base| |c_ULTIMATE.start_check_~a#1.base|)) (= |c_ULTIMATE.start_check_~i~0#1| 0) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse8 (+ (* 4 0) 0)) (.cse7 (+ (* .cse16 4) 0)) (.cse1 (+ (- 1) 1)) (.cse2 (* (- 1) 1)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_check_~a0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse3 (+ .cse4 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse1 (+ .cse2 v_prenex_8)) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (= (select .cse0 .cse3) 0) (= (select .cse0 (+ .cse4 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse5 (let ((.cse6 (store (store .cse0 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse9 (select .cse6 .cse7))) (store (store .cse6 .cse7 (+ (select .cse6 .cse8) .cse9)) .cse8 .cse9)))) (= (store .cse0 .cse3 v_prenex_7) .cse10)))))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (@diff v_arrayElimCell_44 .cse0)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse11 0)) (= .cse5 (let ((.cse12 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse13 (select .cse12 .cse7))) (store (store .cse12 .cse7 (+ (select .cse12 .cse8) .cse13)) .cse8 .cse13)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse11) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse1 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse2)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse0 (+ .cse15 0)) 0) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse10))))) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|))))) (> (+ .cse16 (* (- 1) 0)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= |c_ULTIMATE.start_check_~sum~0#1| 0))) is different from false [2023-02-17 02:47:02,881 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 0 1))) (and (not (= |c_ULTIMATE.start_check_~a0#1.base| |c_ULTIMATE.start_check_~a#1.base|)) (= |c_ULTIMATE.start_check_~i~0#1| 0) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse8 (+ (* 4 0) 0)) (.cse7 (+ (* .cse16 4) 0)) (.cse1 (+ (- 1) 1)) (.cse2 (* (- 1) 1)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_check_~a0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse3 (+ .cse4 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse1 (+ .cse2 v_prenex_8)) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (= (select .cse0 .cse3) 0) (= (select .cse0 (+ .cse4 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse5 (let ((.cse6 (store (store .cse0 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse9 (select .cse6 .cse7))) (store (store .cse6 .cse7 (+ (select .cse6 .cse8) .cse9)) .cse8 .cse9)))) (= (store .cse0 .cse3 v_prenex_7) .cse10)))))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (@diff v_arrayElimCell_44 .cse0)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse11 0)) (= .cse5 (let ((.cse12 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse13 (select .cse12 .cse7))) (store (store .cse12 .cse7 (+ (select .cse12 .cse8) .cse13)) .cse8 .cse13)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse11) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse1 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse2)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse0 (+ .cse15 0)) 0) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse10))))) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|))))) (> (+ .cse16 (* (- 1) 0)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= |c_ULTIMATE.start_check_~sum~0#1| 0))) is different from true [2023-02-17 02:47:02,970 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 (* (- 1) 0)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse4 (+ (- 1) 1)) (.cse5 (* (- 1) 1)) (.cse1 ((as const (Array Int Int)) 0)) (.cse12 (* |c_ULTIMATE.start_check_~i~0#1| 4))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse6 (* v_prenex_6 4))) (let ((.cse3 (+ .cse6 |ULTIMATE.start_main_~a0~0#1.offset|)) (.cse2 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse2 (store .cse1 .cse3 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse4 (+ .cse5 v_prenex_8)) (= (select .cse1 .cse3) 0) (= (select .cse1 (+ .cse6 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse8 (store (store .cse1 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse2 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))) (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse17 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse1)) (.cse16 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse13 0)) (= .cse7 (let ((.cse14 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse15 (select .cse14 .cse9))) (store (store .cse14 .cse9 (+ (select .cse14 .cse10) .cse15)) .cse10 .cse15)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse13) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse4 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse5)) (= (select v_arrayElimCell_44 .cse16) 0) (= (select .cse1 (+ .cse17 0)) 0) (= .cse18 (store v_arrayElimCell_44 .cse16 v_ArrVal_1207)))))))) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse18 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))))) (= |c_ULTIMATE.start_check_~sum~0#1| 0))) is different from false [2023-02-17 02:47:02,974 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 (* (- 1) 0)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse4 (+ (- 1) 1)) (.cse5 (* (- 1) 1)) (.cse1 ((as const (Array Int Int)) 0)) (.cse12 (* |c_ULTIMATE.start_check_~i~0#1| 4))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse6 (* v_prenex_6 4))) (let ((.cse3 (+ .cse6 |ULTIMATE.start_main_~a0~0#1.offset|)) (.cse2 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse2 (store .cse1 .cse3 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse4 (+ .cse5 v_prenex_8)) (= (select .cse1 .cse3) 0) (= (select .cse1 (+ .cse6 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse8 (store (store .cse1 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse2 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))) (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse17 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse1)) (.cse16 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse13 0)) (= .cse7 (let ((.cse14 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse15 (select .cse14 .cse9))) (store (store .cse14 .cse9 (+ (select .cse14 .cse10) .cse15)) .cse10 .cse15)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse13) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse4 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse5)) (= (select v_arrayElimCell_44 .cse16) 0) (= (select .cse1 (+ .cse17 0)) 0) (= .cse18 (store v_arrayElimCell_44 .cse16 v_ArrVal_1207)))))))) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse18 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))))) (= |c_ULTIMATE.start_check_~sum~0#1| 0))) is different from true [2023-02-17 02:47:03,008 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1)) (.cse1 (* (- 1) 0))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 .cse1) 0) (let ((.cse3 (* |c_ULTIMATE.start_check_~i~0#1| 4)) (.cse4 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse12 (+ (- 1) 1)) (.cse13 (* (- 1) 1)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse5 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= (select .cse2 (+ .cse3 |ULTIMATE.start_check_~a0#1.offset|)) .cse4) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse5)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse5 (store v_arrayElimCell_44 .cse6 0)) (= .cse7 (let ((.cse8 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse12 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse13)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse5 (+ .cse15 0)) 0) (= .cse2 (store v_arrayElimCell_44 .cse14 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse5 (@diff .cse5 .cse5)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (* v_prenex_6 4))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse17 (+ .cse18 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (= (select .cse16 (+ .cse3 |ULTIMATE.start_check_~a0#1.offset|)) .cse4) (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse16 (store .cse5 .cse17 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse12 (+ .cse13 v_prenex_8)) (= (select .cse5 .cse17) 0) (= (select .cse5 (+ .cse18 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse19 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse20 (select .cse19 .cse9))) (store (store .cse19 .cse9 (+ (select .cse19 .cse10) .cse20)) .cse10 .cse20)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0))) is different from false [2023-02-17 02:47:03,011 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1)) (.cse1 (* (- 1) 0))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 .cse1) 0) (let ((.cse3 (* |c_ULTIMATE.start_check_~i~0#1| 4)) (.cse4 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse12 (+ (- 1) 1)) (.cse13 (* (- 1) 1)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse5 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= (select .cse2 (+ .cse3 |ULTIMATE.start_check_~a0#1.offset|)) .cse4) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse5)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse5 (store v_arrayElimCell_44 .cse6 0)) (= .cse7 (let ((.cse8 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse12 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse13)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse5 (+ .cse15 0)) 0) (= .cse2 (store v_arrayElimCell_44 .cse14 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse5 (@diff .cse5 .cse5)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (* v_prenex_6 4))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse17 (+ .cse18 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (= (select .cse16 (+ .cse3 |ULTIMATE.start_check_~a0#1.offset|)) .cse4) (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse16 (store .cse5 .cse17 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse12 (+ .cse13 v_prenex_8)) (= (select .cse5 .cse17) 0) (= (select .cse5 (+ .cse18 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse19 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse20 (select .cse19 .cse9))) (store (store .cse19 .cse9 (+ (select .cse19 .cse10) .cse20)) .cse10 .cse20)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0))) is different from true [2023-02-17 02:47:03,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1)) (.cse1 (* (- 1) 0)) (.cse21 (+ (- 1) |c_ULTIMATE.start_check_~i~0#1|))) (and (> (+ .cse0 .cse1) 0) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse4 (* .cse21 4)) (.cse12 (+ (- 1) 1)) (.cse13 (* (- 1) 1)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse5 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= .cse2 (select .cse3 (+ .cse4 |ULTIMATE.start_check_~a0#1.offset|))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse5)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse5 (store v_arrayElimCell_44 .cse6 0)) (= .cse7 (let ((.cse8 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse12 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse13)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse5 (+ .cse15 0)) 0) (= .cse3 (store v_arrayElimCell_44 .cse14 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse5 (@diff .cse5 .cse5)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (* v_prenex_6 4))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse17 (+ .cse18 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse16 (store .cse5 .cse17 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= .cse2 (select .cse16 (+ .cse4 |ULTIMATE.start_check_~a0#1.offset|))) (< v_prenex_6 v_prenex_10) (<= .cse12 (+ .cse13 v_prenex_8)) (= (select .cse5 .cse17) 0) (= (select .cse5 (+ .cse18 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse19 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse20 (select .cse19 .cse9))) (store (store .cse19 .cse9 (+ (select .cse19 .cse10) .cse20)) .cse10 .cse20)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= .cse21 0))) is different from false [2023-02-17 02:47:03,046 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1)) (.cse1 (* (- 1) 0)) (.cse21 (+ (- 1) |c_ULTIMATE.start_check_~i~0#1|))) (and (> (+ .cse0 .cse1) 0) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse4 (* .cse21 4)) (.cse12 (+ (- 1) 1)) (.cse13 (* (- 1) 1)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse5 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= .cse2 (select .cse3 (+ .cse4 |ULTIMATE.start_check_~a0#1.offset|))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse5)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse5 (store v_arrayElimCell_44 .cse6 0)) (= .cse7 (let ((.cse8 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse12 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse13)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse5 (+ .cse15 0)) 0) (= .cse3 (store v_arrayElimCell_44 .cse14 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse5 (@diff .cse5 .cse5)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (* v_prenex_6 4))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse17 (+ .cse18 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse16 (store .cse5 .cse17 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= .cse2 (select .cse16 (+ .cse4 |ULTIMATE.start_check_~a0#1.offset|))) (< v_prenex_6 v_prenex_10) (<= .cse12 (+ .cse13 v_prenex_8)) (= (select .cse5 .cse17) 0) (= (select .cse5 (+ .cse18 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse19 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse20 (select .cse19 .cse9))) (store (store .cse19 .cse9 (+ (select .cse19 .cse10) .cse20)) .cse10 .cse20)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= .cse21 0))) is different from true [2023-02-17 02:47:03,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:47:03,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 447 treesize of output 457 [2023-02-17 02:47:03,171 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (+ 0 1)) (.cse27 (* (- 1) 0))) (and (let ((.cse9 (+ (- 1) 1)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse13 (= (select .cse5 (@diff .cse5 .cse5)) 0)) (.cse3 (+ (* 4 0) 0)) (.cse2 (+ (* .cse28 4) 0)) (.cse10 (* (- 1) 1)) (.cse6 (+ .cse27 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse7 (* .cse9 4))) (or (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse12 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (+ .cse12 v_prenex_13))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse5)) (.cse0 (store v_arrayElimCell_44 .cse11 v_ArrVal_1207))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 (let ((.cse1 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse4 (select .cse1 .cse2))) (store (store .cse1 .cse2 (+ (select .cse1 .cse3) .cse4)) .cse3 .cse4)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select .cse0 (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse8 0)) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse11) 0) (<= v_prenex_12 v_prenex_13) (= |c_ULTIMATE.start_check_#t~mem11#1| (select .cse0 (+ (* 4 1) 0))) (= (select .cse5 (+ .cse12 0)) 0)))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse19 (select .cse18 .cse2))) (let ((.cse17 (* v_prenex_6 4)) (.cse15 (+ (select .cse18 .cse3) .cse19))) (let ((.cse14 (store (store .cse18 .cse2 .cse15) .cse3 .cse19)) (.cse16 (+ .cse17 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse6 (select .cse14 (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| .cse15) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse14 (store .cse5 .cse16 v_prenex_7)) (= (select .cse5 .cse16) 0) (= (select .cse5 (+ .cse17 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1))))))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse23 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse21 (@diff v_arrayElimCell_44 .cse5)) (.cse20 (+ .cse23 v_prenex_13))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select (store v_arrayElimCell_44 .cse20 v_ArrVal_1207) (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse21 0)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse22 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (+ (select .cse22 .cse3) (select .cse22 .cse2)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse21) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse20) 0) (<= v_prenex_12 v_prenex_13) (= (select .cse5 (+ .cse23 0)) 0))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse26 (* v_prenex_6 4))) (let ((.cse25 (+ .cse26 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse24 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (+ (select .cse24 .cse3) (select .cse24 .cse2)))) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse6 (select (store .cse5 .cse25 v_prenex_7) (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (= (select .cse5 .cse25) 0) (= (select .cse5 (+ .cse26 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)))))))))) (> (+ .cse28 .cse27) 0))) is different from false [2023-02-17 02:47:03,178 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse28 (+ 0 1)) (.cse27 (* (- 1) 0))) (and (let ((.cse9 (+ (- 1) 1)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse13 (= (select .cse5 (@diff .cse5 .cse5)) 0)) (.cse3 (+ (* 4 0) 0)) (.cse2 (+ (* .cse28 4) 0)) (.cse10 (* (- 1) 1)) (.cse6 (+ .cse27 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse7 (* .cse9 4))) (or (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse12 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (+ .cse12 v_prenex_13))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse5)) (.cse0 (store v_arrayElimCell_44 .cse11 v_ArrVal_1207))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 (let ((.cse1 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse4 (select .cse1 .cse2))) (store (store .cse1 .cse2 (+ (select .cse1 .cse3) .cse4)) .cse3 .cse4)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select .cse0 (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse8 0)) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse11) 0) (<= v_prenex_12 v_prenex_13) (= |c_ULTIMATE.start_check_#t~mem11#1| (select .cse0 (+ (* 4 1) 0))) (= (select .cse5 (+ .cse12 0)) 0)))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse19 (select .cse18 .cse2))) (let ((.cse17 (* v_prenex_6 4)) (.cse15 (+ (select .cse18 .cse3) .cse19))) (let ((.cse14 (store (store .cse18 .cse2 .cse15) .cse3 .cse19)) (.cse16 (+ .cse17 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse6 (select .cse14 (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| .cse15) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse14 (store .cse5 .cse16 v_prenex_7)) (= (select .cse5 .cse16) 0) (= (select .cse5 (+ .cse17 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1))))))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse23 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse21 (@diff v_arrayElimCell_44 .cse5)) (.cse20 (+ .cse23 v_prenex_13))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select (store v_arrayElimCell_44 .cse20 v_ArrVal_1207) (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse21 0)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse22 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (+ (select .cse22 .cse3) (select .cse22 .cse2)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse21) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse20) 0) (<= v_prenex_12 v_prenex_13) (= (select .cse5 (+ .cse23 0)) 0))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse26 (* v_prenex_6 4))) (let ((.cse25 (+ .cse26 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse24 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (+ (select .cse24 .cse3) (select .cse24 .cse2)))) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse6 (select (store .cse5 .cse25 v_prenex_7) (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (= (select .cse5 .cse25) 0) (= (select .cse5 (+ .cse26 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)))))))))) (> (+ .cse28 .cse27) 0))) is different from true [2023-02-17 02:47:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2023-02-17 02:47:03,286 INFO L328 TraceCheckSpWp]: Computing backward predicates...