./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:28:13,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:28:13,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:28:13,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:28:13,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:28:13,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:28:13,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:28:13,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:28:13,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:28:13,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:28:13,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:28:13,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:28:13,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:28:13,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:28:13,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:28:13,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:28:13,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:28:13,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:28:13,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:28:13,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:28:13,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:28:13,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:28:13,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:28:13,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:28:13,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:28:13,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:28:13,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:28:13,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:28:13,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:28:13,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:28:13,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:28:13,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:28:13,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:28:13,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:28:13,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:28:13,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:28:13,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:28:13,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:28:13,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:28:13,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:28:13,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:28:13,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:28:13,311 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:28:13,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:28:13,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:28:13,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:28:13,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:28:13,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:28:13,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:28:13,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:28:13,315 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:28:13,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:28:13,316 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:28:13,316 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:28:13,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:28:13,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:28:13,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:28:13,317 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:28:13,317 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:28:13,317 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:28:13,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:28:13,318 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:28:13,318 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:28:13,318 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:28:13,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:28:13,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:28:13,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:28:13,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:28:13,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:28:13,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:28:13,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:28:13,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:28:13,320 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:28:13,320 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:28:13,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:28:13,321 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:28:13,321 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-02-15 13:28:13,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:28:13,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:28:13,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:28:13,624 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:28:13,624 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:28:13,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-02-15 13:28:14,805 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:28:15,070 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:28:15,071 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-02-15 13:28:15,082 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9466d12b4/3a56c92ac0334f989f200269763662e4/FLAG0f9968190 [2023-02-15 13:28:15,093 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9466d12b4/3a56c92ac0334f989f200269763662e4 [2023-02-15 13:28:15,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:28:15,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:28:15,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:28:15,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:28:15,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:28:15,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b88d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15, skipping insertion in model container [2023-02-15 13:28:15,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:28:15,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:28:15,438 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-02-15 13:28:15,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:28:15,455 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:28:15,500 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-02-15 13:28:15,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:28:15,525 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:28:15,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15 WrapperNode [2023-02-15 13:28:15,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:28:15,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:28:15,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:28:15,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:28:15,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,566 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2023-02-15 13:28:15,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:28:15,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:28:15,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:28:15,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:28:15,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,616 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:28:15,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:28:15,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:28:15,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:28:15,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (1/1) ... [2023-02-15 13:28:15,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:28:15,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:15,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:28:15,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:28:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:28:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:28:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 13:28:15,696 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 13:28:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:28:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:28:15,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 13:28:15,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:28:15,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:28:15,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:28:15,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 13:28:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:28:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:28:15,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:28:15,839 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:28:15,841 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:28:16,209 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:28:16,215 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:28:16,215 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 13:28:16,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:28:16 BoogieIcfgContainer [2023-02-15 13:28:16,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:28:16,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:28:16,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:28:16,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:28:16,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:28:15" (1/3) ... [2023-02-15 13:28:16,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddf4482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:28:16, skipping insertion in model container [2023-02-15 13:28:16,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:28:15" (2/3) ... [2023-02-15 13:28:16,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddf4482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:28:16, skipping insertion in model container [2023-02-15 13:28:16,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:28:16" (3/3) ... [2023-02-15 13:28:16,229 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-02-15 13:28:16,244 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:28:16,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-02-15 13:28:16,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:28:16,298 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;@1208f34, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:28:16,298 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-02-15 13:28:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:28:16,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:16,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:28:16,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:16,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash 895152213, now seen corresponding path program 1 times [2023-02-15 13:28:16,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:16,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453865091] [2023-02-15 13:28:16,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:16,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:28:16,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:16,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453865091] [2023-02-15 13:28:16,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453865091] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:16,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:16,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:28:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202817984] [2023-02-15 13:28:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:16,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:28:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:16,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:28:16,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:28:16,578 INFO L87 Difference]: Start difference. First operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:28:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:16,685 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2023-02-15 13:28:16,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:28:16,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 13:28:16,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:16,694 INFO L225 Difference]: With dead ends: 117 [2023-02-15 13:28:16,695 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 13:28:16,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:28:16,699 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:16,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:28:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 13:28:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-02-15 13:28:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 109 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2023-02-15 13:28:16,735 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 6 [2023-02-15 13:28:16,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:16,735 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2023-02-15 13:28:16,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:28:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2023-02-15 13:28:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:28:16,736 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:16,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:28:16,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:28:16,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash 895152214, now seen corresponding path program 1 times [2023-02-15 13:28:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:16,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26934342] [2023-02-15 13:28:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:28:16,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:16,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26934342] [2023-02-15 13:28:16,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26934342] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:16,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:16,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:28:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403312968] [2023-02-15 13:28:16,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:16,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:28:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:28:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:28:16,860 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:28:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:16,940 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2023-02-15 13:28:16,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:28:16,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 13:28:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:16,942 INFO L225 Difference]: With dead ends: 112 [2023-02-15 13:28:16,942 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 13:28:16,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:28:16,943 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:16,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:28:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 13:28:16,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-02-15 13:28:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 60 states have (on average 1.9) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2023-02-15 13:28:16,952 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 6 [2023-02-15 13:28:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:16,952 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2023-02-15 13:28:16,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:28:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2023-02-15 13:28:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:28:16,953 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:16,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:16,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:28:16,954 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:16,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:16,955 INFO L85 PathProgramCache]: Analyzing trace with hash 972366423, now seen corresponding path program 1 times [2023-02-15 13:28:16,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:16,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120447933] [2023-02-15 13:28:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:28:17,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:17,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120447933] [2023-02-15 13:28:17,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120447933] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:17,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:17,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:28:17,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716835532] [2023-02-15 13:28:17,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:17,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:28:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:17,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:28:17,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:28:17,051 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:28:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:17,156 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2023-02-15 13:28:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:28:17,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 13:28:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:17,161 INFO L225 Difference]: With dead ends: 119 [2023-02-15 13:28:17,162 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 13:28:17,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:28:17,168 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:17,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 275 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:28:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 13:28:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2023-02-15 13:28:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2023-02-15 13:28:17,188 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 13 [2023-02-15 13:28:17,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:17,189 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2023-02-15 13:28:17,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:28:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2023-02-15 13:28:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:28:17,190 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:17,190 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:17,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:28:17,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:17,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573860, now seen corresponding path program 1 times [2023-02-15 13:28:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:17,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877387909] [2023-02-15 13:28:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:17,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:17,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:17,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:17,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877387909] [2023-02-15 13:28:17,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877387909] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:17,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:17,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:28:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475577880] [2023-02-15 13:28:17,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:17,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:28:17,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:17,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:28:17,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:28:17,451 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:28:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:17,711 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2023-02-15 13:28:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:28:17,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-15 13:28:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:17,714 INFO L225 Difference]: With dead ends: 113 [2023-02-15 13:28:17,714 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 13:28:17,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:28:17,715 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 13 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:17,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 387 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:28:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 13:28:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2023-02-15 13:28:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2023-02-15 13:28:17,722 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 22 [2023-02-15 13:28:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:17,722 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2023-02-15 13:28:17,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:28:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2023-02-15 13:28:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:28:17,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:17,723 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:17,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:28:17,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573859, now seen corresponding path program 1 times [2023-02-15 13:28:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:17,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393714387] [2023-02-15 13:28:17,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:17,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:17,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:17,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:17,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393714387] [2023-02-15 13:28:17,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393714387] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:17,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:17,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:28:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555837996] [2023-02-15 13:28:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:17,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:28:17,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:17,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:28:17,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:28:17,948 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:28:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:18,171 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2023-02-15 13:28:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:28:18,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-15 13:28:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:18,173 INFO L225 Difference]: With dead ends: 112 [2023-02-15 13:28:18,178 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 13:28:18,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:28:18,179 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:18,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 411 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:28:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 13:28:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2023-02-15 13:28:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-02-15 13:28:18,191 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 22 [2023-02-15 13:28:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:18,192 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-02-15 13:28:18,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:28:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-02-15 13:28:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:28:18,193 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:18,193 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:18,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:28:18,194 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413691, now seen corresponding path program 1 times [2023-02-15 13:28:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:18,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629121913] [2023-02-15 13:28:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:18,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:28:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:18,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629121913] [2023-02-15 13:28:18,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629121913] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:18,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932409319] [2023-02-15 13:28:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:18,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:18,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:18,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:28:18,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:28:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:18,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:28:18,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:18,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:18,768 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2023-02-15 13:28:18,780 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2023-02-15 13:28:18,798 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:28:18,798 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 12 treesize of output 18 [2023-02-15 13:28:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 13:28:18,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:19,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932409319] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:28:19,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:28:19,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-15 13:28:19,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637955953] [2023-02-15 13:28:19,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:19,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 13:28:19,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:19,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 13:28:19,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-15 13:28:19,078 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:28:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:19,431 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2023-02-15 13:28:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:28:19,432 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-15 13:28:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:19,433 INFO L225 Difference]: With dead ends: 128 [2023-02-15 13:28:19,433 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 13:28:19,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-15 13:28:19,437 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 97 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:19,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 483 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 475 Invalid, 0 Unknown, 266 Unchecked, 0.3s Time] [2023-02-15 13:28:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 13:28:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2023-02-15 13:28:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2023-02-15 13:28:19,448 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 25 [2023-02-15 13:28:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:19,448 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2023-02-15 13:28:19,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:28:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2023-02-15 13:28:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:28:19,450 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:19,450 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:19,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:19,656 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-15 13:28:19,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413690, now seen corresponding path program 1 times [2023-02-15 13:28:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:19,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634048373] [2023-02-15 13:28:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:19,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:20,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:20,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634048373] [2023-02-15 13:28:20,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634048373] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:20,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251367065] [2023-02-15 13:28:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:20,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:20,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:20,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:28:20,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:28:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:20,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:28:20,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:20,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:20,484 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:20,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:28:20,505 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 11 [2023-02-15 13:28:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:28:20,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:20,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251367065] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:20,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:20,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-15 13:28:20,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470236063] [2023-02-15 13:28:20,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:20,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 13:28:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:20,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 13:28:20,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2023-02-15 13:28:20,725 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 13:28:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:21,309 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2023-02-15 13:28:21,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:28:21,311 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-02-15 13:28:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:21,312 INFO L225 Difference]: With dead ends: 111 [2023-02-15 13:28:21,312 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 13:28:21,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:28:21,313 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 199 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:21,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 674 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:28:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 13:28:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2023-02-15 13:28:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 61 states have (on average 1.819672131147541) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2023-02-15 13:28:21,322 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 25 [2023-02-15 13:28:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:21,323 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2023-02-15 13:28:21,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 13:28:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2023-02-15 13:28:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:28:21,324 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:21,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:21,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:21,525 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,SelfDestructingSolverStorable6 [2023-02-15 13:28:21,525 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash 512234271, now seen corresponding path program 1 times [2023-02-15 13:28:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:21,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267024991] [2023-02-15 13:28:21,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:21,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:21,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:21,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:28:21,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:21,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267024991] [2023-02-15 13:28:21,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267024991] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:21,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097988831] [2023-02-15 13:28:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:21,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:21,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:21,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:28:22,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:28:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:22,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 13:28:22,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:22,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:22,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:28:22,188 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:28:22,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:22,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:28:22,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:28:22,249 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_522))))) is different from true [2023-02-15 13:28:22,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:22,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:28:22,314 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 13:28:22,333 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:22,334 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 12 treesize of output 14 [2023-02-15 13:28:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2023-02-15 13:28:22,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:22,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097988831] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:22,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:22,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2023-02-15 13:28:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220171252] [2023-02-15 13:28:22,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:22,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:28:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:28:22,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=122, Unknown=3, NotChecked=72, Total=240 [2023-02-15 13:28:22,488 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 13:28:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:22,728 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2023-02-15 13:28:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:28:22,728 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2023-02-15 13:28:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:22,729 INFO L225 Difference]: With dead ends: 118 [2023-02-15 13:28:22,729 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 13:28:22,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=163, Unknown=3, NotChecked=84, Total=306 [2023-02-15 13:28:22,730 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 251 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:22,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 217 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 273 Invalid, 0 Unknown, 303 Unchecked, 0.2s Time] [2023-02-15 13:28:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 13:28:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2023-02-15 13:28:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-02-15 13:28:22,733 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 37 [2023-02-15 13:28:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:22,734 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-02-15 13:28:22,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 13:28:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-02-15 13:28:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:28:22,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:22,735 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:22,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:22,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:22,936 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash 512234272, now seen corresponding path program 1 times [2023-02-15 13:28:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:22,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941120329] [2023-02-15 13:28:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:23,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:28:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:23,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941120329] [2023-02-15 13:28:23,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941120329] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:23,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621005784] [2023-02-15 13:28:23,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:23,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:23,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:23,476 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:28:23,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:28:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:23,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:28:23,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:23,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:23,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:28:23,684 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_683 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_683) |c_#length|)))) is different from true [2023-02-15 13:28:23,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:23,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:28:23,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:28:23,758 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_684 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_684) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:28:23,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:23,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:28:23,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:28:23,851 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_685 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_685))))) is different from true [2023-02-15 13:28:23,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:23,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:28:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-15 13:28:23,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:24,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621005784] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:24,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:24,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-15 13:28:24,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408930029] [2023-02-15 13:28:24,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:24,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 13:28:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:24,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 13:28:24,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2023-02-15 13:28:24,324 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:28:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:24,716 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2023-02-15 13:28:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:28:24,717 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2023-02-15 13:28:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:24,718 INFO L225 Difference]: With dead ends: 109 [2023-02-15 13:28:24,718 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 13:28:24,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=336, Unknown=3, NotChecked=120, Total=552 [2023-02-15 13:28:24,719 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 473 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:24,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 259 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 354 Invalid, 0 Unknown, 333 Unchecked, 0.3s Time] [2023-02-15 13:28:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 13:28:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2023-02-15 13:28:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2023-02-15 13:28:24,723 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 37 [2023-02-15 13:28:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:24,723 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2023-02-15 13:28:24,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:28:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2023-02-15 13:28:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:28:24,725 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:24,725 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:24,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:24,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:24,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash -47629334, now seen corresponding path program 1 times [2023-02-15 13:28:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:24,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969984806] [2023-02-15 13:28:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 13:28:25,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:25,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969984806] [2023-02-15 13:28:25,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969984806] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:25,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:25,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:28:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042440359] [2023-02-15 13:28:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:25,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:28:25,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:28:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:28:25,062 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:28:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:25,210 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2023-02-15 13:28:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:28:25,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-15 13:28:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:25,211 INFO L225 Difference]: With dead ends: 107 [2023-02-15 13:28:25,211 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 13:28:25,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:28:25,212 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:25,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 266 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:28:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 13:28:25,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2023-02-15 13:28:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2023-02-15 13:28:25,215 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 40 [2023-02-15 13:28:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:25,215 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2023-02-15 13:28:25,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:28:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2023-02-15 13:28:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:28:25,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:25,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:25,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:28:25,216 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash -47629333, now seen corresponding path program 1 times [2023-02-15 13:28:25,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:25,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212212130] [2023-02-15 13:28:25,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:25,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 13:28:25,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:25,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212212130] [2023-02-15 13:28:25,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212212130] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:25,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:25,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:28:25,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100145491] [2023-02-15 13:28:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:25,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:28:25,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:25,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:28:25,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:28:25,428 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:28:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:25,564 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2023-02-15 13:28:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:28:25,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-15 13:28:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:25,566 INFO L225 Difference]: With dead ends: 87 [2023-02-15 13:28:25,566 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 13:28:25,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:28:25,566 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:25,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:28:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 13:28:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-15 13:28:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.459016393442623) internal successors, (89), 82 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2023-02-15 13:28:25,569 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 40 [2023-02-15 13:28:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:25,569 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2023-02-15 13:28:25,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:28:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2023-02-15 13:28:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:28:25,570 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:25,570 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:25,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:28:25,570 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:25,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263067, now seen corresponding path program 1 times [2023-02-15 13:28:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:25,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255884369] [2023-02-15 13:28:25,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:25,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 13:28:26,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:26,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255884369] [2023-02-15 13:28:26,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255884369] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:26,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402297723] [2023-02-15 13:28:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:26,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:26,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:26,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:28:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:28:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:26,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 13:28:26,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:26,469 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 9 treesize of output 5 [2023-02-15 13:28:26,560 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1053 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1053)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:28:26,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:26,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:28:26,600 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-15 13:28:26,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-02-15 13:28:26,634 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 17 treesize of output 9 [2023-02-15 13:28:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:28:26,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:28:26,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402297723] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:26,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:28:26,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 24 [2023-02-15 13:28:26,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865755930] [2023-02-15 13:28:26,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:26,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:28:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:26,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:28:26,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2023-02-15 13:28:26,640 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:28:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:27,112 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2023-02-15 13:28:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:28:27,112 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-02-15 13:28:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:27,113 INFO L225 Difference]: With dead ends: 150 [2023-02-15 13:28:27,113 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 13:28:27,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=716, Unknown=1, NotChecked=56, Total=930 [2023-02-15 13:28:27,114 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 376 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:27,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 457 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 549 Invalid, 0 Unknown, 142 Unchecked, 0.3s Time] [2023-02-15 13:28:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 13:28:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 86. [2023-02-15 13:28:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.435483870967742) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-02-15 13:28:27,117 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 41 [2023-02-15 13:28:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:27,118 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-02-15 13:28:27,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:28:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-02-15 13:28:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:28:27,118 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:27,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:27,130 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-15 13:28:27,327 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,SelfDestructingSolverStorable11 [2023-02-15 13:28:27,327 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263066, now seen corresponding path program 1 times [2023-02-15 13:28:27,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:27,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003434732] [2023-02-15 13:28:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:27,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:27,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:27,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:28,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:28,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003434732] [2023-02-15 13:28:28,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003434732] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:28,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201883401] [2023-02-15 13:28:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:28,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:28,199 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-15 13:28:28,202 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-15 13:28:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:28,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-15 13:28:28,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:28,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-15 13:28:28,717 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 19 treesize of output 11 [2023-02-15 13:28:28,874 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1211 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1211))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1212 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1212))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1208 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1208) |c_#length|)))) is different from true [2023-02-15 13:28:28,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:28,915 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 31 treesize of output 31 [2023-02-15 13:28:28,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:28,922 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 22 treesize of output 24 [2023-02-15 13:28:28,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:28,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-15 13:28:28,940 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:28:28,944 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 15 treesize of output 15 [2023-02-15 13:28:29,003 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 15 [2023-02-15 13:28:29,006 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 14 [2023-02-15 13:28:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2023-02-15 13:28:29,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:29,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201883401] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:29,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:29,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2023-02-15 13:28:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372921152] [2023-02-15 13:28:29,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:29,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 13:28:29,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:29,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 13:28:29,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1154, Unknown=2, NotChecked=68, Total=1332 [2023-02-15 13:28:29,856 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:28:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:31,587 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2023-02-15 13:28:31,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 13:28:31,591 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-02-15 13:28:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:31,592 INFO L225 Difference]: With dead ends: 142 [2023-02-15 13:28:31,592 INFO L226 Difference]: Without dead ends: 142 [2023-02-15 13:28:31,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=323, Invalid=2538, Unknown=5, NotChecked=104, Total=2970 [2023-02-15 13:28:31,593 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 445 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:31,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1198 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1216 Invalid, 3 Unknown, 104 Unchecked, 0.8s Time] [2023-02-15 13:28:31,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-15 13:28:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 94. [2023-02-15 13:28:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2023-02-15 13:28:31,596 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 41 [2023-02-15 13:28:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:31,597 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2023-02-15 13:28:31,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:28:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2023-02-15 13:28:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 13:28:31,597 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:31,598 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:31,604 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-15 13:28:31,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:31,804 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:31,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1928392465, now seen corresponding path program 1 times [2023-02-15 13:28:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:31,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817806195] [2023-02-15 13:28:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:32,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:32,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:32,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:32,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817806195] [2023-02-15 13:28:32,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817806195] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:32,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563875150] [2023-02-15 13:28:32,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:32,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:32,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:32,444 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-15 13:28:32,447 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-15 13:28:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:32,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 13:28:32,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:32,819 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 8 treesize of output 4 [2023-02-15 13:28:32,869 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1402 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1402)))) is different from true [2023-02-15 13:28:32,876 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1403 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1403))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:28:32,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:32,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 13:28:32,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 13:28:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-02-15 13:28:32,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:32,990 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_37| Int) (v_ArrVal_1407 (Array Int Int))) (or (not (< |v_node_create_~temp~0#1.base_37| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37| v_ArrVal_1407) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)))) is different from false [2023-02-15 13:28:32,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563875150] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:32,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:32,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2023-02-15 13:28:32,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655640332] [2023-02-15 13:28:32,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:32,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 13:28:32,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 13:28:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=900, Unknown=3, NotChecked=186, Total=1190 [2023-02-15 13:28:32,994 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 33 states, 31 states have (on average 2.096774193548387) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:28:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:33,630 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-02-15 13:28:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:28:33,631 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.096774193548387) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2023-02-15 13:28:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:33,631 INFO L225 Difference]: With dead ends: 97 [2023-02-15 13:28:33,631 INFO L226 Difference]: Without dead ends: 97 [2023-02-15 13:28:33,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=1591, Unknown=5, NotChecked=252, Total=2070 [2023-02-15 13:28:33,632 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 339 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:33,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 645 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 671 Invalid, 0 Unknown, 183 Unchecked, 0.3s Time] [2023-02-15 13:28:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-15 13:28:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2023-02-15 13:28:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2023-02-15 13:28:33,635 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 44 [2023-02-15 13:28:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:33,635 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2023-02-15 13:28:33,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.096774193548387) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:28:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2023-02-15 13:28:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:28:33,636 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:33,636 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:33,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:33,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:33,845 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash -710984888, now seen corresponding path program 1 times [2023-02-15 13:28:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:33,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826824584] [2023-02-15 13:28:33,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:33,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:34,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:34,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:34,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:35,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826824584] [2023-02-15 13:28:35,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826824584] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:35,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042721768] [2023-02-15 13:28:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:35,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:35,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:35,109 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-15 13:28:35,134 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-15 13:28:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:35,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 94 conjunts are in the unsatisfiable core [2023-02-15 13:28:35,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:35,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:35,530 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:35,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:28:35,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:35,761 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:35,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 13:28:35,939 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:35,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2023-02-15 13:28:35,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:35,954 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 7 treesize of output 3 [2023-02-15 13:28:36,082 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1569 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_1570 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1570)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1569) |c_#memory_$Pointer$.offset|))) is different from true [2023-02-15 13:28:36,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:36,153 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:36,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 51 [2023-02-15 13:28:36,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:36,161 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 51 treesize of output 49 [2023-02-15 13:28:36,193 INFO L321 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2023-02-15 13:28:36,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 60 [2023-02-15 13:28:36,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2023-02-15 13:28:36,400 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:36,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2023-02-15 13:28:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 13:28:36,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:36,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042721768] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:36,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:36,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2023-02-15 13:28:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083586453] [2023-02-15 13:28:36,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:36,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 13:28:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:36,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 13:28:36,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1924, Unknown=1, NotChecked=88, Total=2162 [2023-02-15 13:28:36,596 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:38,358 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2023-02-15 13:28:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 13:28:38,359 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2023-02-15 13:28:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:38,360 INFO L225 Difference]: With dead ends: 193 [2023-02-15 13:28:38,360 INFO L226 Difference]: Without dead ends: 193 [2023-02-15 13:28:38,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=392, Invalid=3517, Unknown=1, NotChecked=122, Total=4032 [2023-02-15 13:28:38,361 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 773 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:38,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 953 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1377 Invalid, 0 Unknown, 188 Unchecked, 0.8s Time] [2023-02-15 13:28:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-02-15 13:28:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 111. [2023-02-15 13:28:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 104 states have internal predecessors, (114), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:28:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2023-02-15 13:28:38,366 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 46 [2023-02-15 13:28:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:38,366 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2023-02-15 13:28:38,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2023-02-15 13:28:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:28:38,367 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:38,367 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:38,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:38,573 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,SelfDestructingSolverStorable14 [2023-02-15 13:28:38,574 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash -710984887, now seen corresponding path program 1 times [2023-02-15 13:28:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:38,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972663733] [2023-02-15 13:28:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:38,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:39,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:40,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972663733] [2023-02-15 13:28:40,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972663733] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:40,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105955535] [2023-02-15 13:28:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:40,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:40,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:40,019 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-15 13:28:40,020 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-15 13:28:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:40,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 120 conjunts are in the unsatisfiable core [2023-02-15 13:28:40,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:40,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:40,458 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:40,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:28:40,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:40,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:40,683 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:40,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2023-02-15 13:28:40,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:28:40,893 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:40,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2023-02-15 13:28:40,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2023-02-15 13:28:41,152 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1746) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1743 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1743) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1747 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1747) |c_#memory_$Pointer$.base|)))) is different from true [2023-02-15 13:28:41,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:41,198 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:41,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 75 [2023-02-15 13:28:41,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:41,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:41,209 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:28:41,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 80 [2023-02-15 13:28:41,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:41,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 13:28:41,233 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 13:28:41,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 13:28:41,511 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:41,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2023-02-15 13:28:41,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-02-15 13:28:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 13:28:41,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:42,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105955535] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:42,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:42,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2023-02-15 13:28:42,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640155255] [2023-02-15 13:28:42,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:42,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 13:28:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:42,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 13:28:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3118, Unknown=5, NotChecked=112, Total=3422 [2023-02-15 13:28:42,072 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:45,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:45,147 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2023-02-15 13:28:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 13:28:45,147 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2023-02-15 13:28:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:45,148 INFO L225 Difference]: With dead ends: 220 [2023-02-15 13:28:45,148 INFO L226 Difference]: Without dead ends: 220 [2023-02-15 13:28:45,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=413, Invalid=5592, Unknown=5, NotChecked=152, Total=6162 [2023-02-15 13:28:45,150 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 352 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 3259 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 3434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:45,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 2495 Invalid, 3434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3259 Invalid, 0 Unknown, 157 Unchecked, 1.8s Time] [2023-02-15 13:28:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-15 13:28:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 110. [2023-02-15 13:28:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 103 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:28:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2023-02-15 13:28:45,155 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 46 [2023-02-15 13:28:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:45,155 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2023-02-15 13:28:45,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2023-02-15 13:28:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:28:45,156 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:45,157 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-15 13:28:45,164 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-15 13:28:45,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 13:28:45,364 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:45,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash 555333, now seen corresponding path program 2 times [2023-02-15 13:28:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:45,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854358980] [2023-02-15 13:28:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:47,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:47,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854358980] [2023-02-15 13:28:47,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854358980] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:47,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349054508] [2023-02-15 13:28:47,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:28:47,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:47,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:47,103 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-15 13:28:47,109 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-15 13:28:47,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:28:47,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:28:47,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 134 conjunts are in the unsatisfiable core [2023-02-15 13:28:47,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:47,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:47,501 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:47,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:28:47,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:47,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:47,772 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:28:47,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2023-02-15 13:28:47,780 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 27 treesize of output 22 [2023-02-15 13:28:48,009 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-02-15 13:28:48,009 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 50 [2023-02-15 13:28:48,018 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:28:48,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2023-02-15 13:28:48,144 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1925)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1924) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:28:48,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:48,186 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 13:28:48,187 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 102 [2023-02-15 13:28:48,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:48,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:48,204 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2023-02-15 13:28:48,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 111 [2023-02-15 13:28:48,224 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 13:28:48,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 13:28:48,763 INFO L321 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2023-02-15 13:28:48,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 82 [2023-02-15 13:28:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 13:28:48,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:49,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349054508] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:49,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:49,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28] total 56 [2023-02-15 13:28:49,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788076517] [2023-02-15 13:28:49,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:49,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-15 13:28:49,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-15 13:28:49,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3695, Unknown=1, NotChecked=122, Total=4032 [2023-02-15 13:28:49,379 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 56 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 49 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:52,018 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2023-02-15 13:28:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 13:28:52,019 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 49 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2023-02-15 13:28:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:52,020 INFO L225 Difference]: With dead ends: 136 [2023-02-15 13:28:52,020 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 13:28:52,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=493, Invalid=6650, Unknown=1, NotChecked=166, Total=7310 [2023-02-15 13:28:52,022 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 201 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:52,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1405 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2549 Invalid, 0 Unknown, 128 Unchecked, 1.2s Time] [2023-02-15 13:28:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 13:28:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2023-02-15 13:28:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 106 states have internal predecessors, (115), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:28:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2023-02-15 13:28:52,026 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 51 [2023-02-15 13:28:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:52,026 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2023-02-15 13:28:52,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 49 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2023-02-15 13:28:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 13:28:52,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:52,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:52,033 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-15 13:28:52,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 13:28:52,233 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:52,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash 430095050, now seen corresponding path program 1 times [2023-02-15 13:28:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:52,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029577651] [2023-02-15 13:28:52,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:52,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:52,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:52,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:53,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:53,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029577651] [2023-02-15 13:28:53,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029577651] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:53,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519700390] [2023-02-15 13:28:53,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:53,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:53,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:53,032 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-15 13:28:53,034 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-15 13:28:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:53,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-15 13:28:53,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:53,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 13:28:53,485 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2124 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2124) |c_#memory_$Pointer$.base|))) is different from true [2023-02-15 13:28:53,497 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2125 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2125))))) is different from true [2023-02-15 13:28:53,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:53,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:28:53,569 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 17 treesize of output 9 [2023-02-15 13:28:53,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:53,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:53,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:28:53,770 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 17 treesize of output 9 [2023-02-15 13:28:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-02-15 13:28:53,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:53,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:53,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-02-15 13:28:53,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:53,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2023-02-15 13:28:53,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-15 13:28:53,977 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:28:53,977 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 28 treesize of output 25 [2023-02-15 13:28:54,145 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((|v_node_create_~temp~0#1.base_49| Int)) (or (not (< |v_node_create_~temp~0#1.base_49| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2132 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_49| v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2023-02-15 13:28:54,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519700390] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:54,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:54,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2023-02-15 13:28:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734142767] [2023-02-15 13:28:54,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:54,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 13:28:54,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:54,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 13:28:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1602, Unknown=21, NotChecked=246, Total=1980 [2023-02-15 13:28:54,149 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 39 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 13:28:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:55,520 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2023-02-15 13:28:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:28:55,521 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2023-02-15 13:28:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:55,522 INFO L225 Difference]: With dead ends: 183 [2023-02-15 13:28:55,522 INFO L226 Difference]: Without dead ends: 183 [2023-02-15 13:28:55,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=402, Invalid=3369, Unknown=23, NotChecked=366, Total=4160 [2023-02-15 13:28:55,523 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1036 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:55,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1007 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1472 Invalid, 0 Unknown, 316 Unchecked, 0.6s Time] [2023-02-15 13:28:55,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-15 13:28:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 122. [2023-02-15 13:28:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 97 states have (on average 1.288659793814433) internal successors, (125), 115 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:28:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2023-02-15 13:28:55,527 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 52 [2023-02-15 13:28:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:55,527 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2023-02-15 13:28:55,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 13:28:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2023-02-15 13:28:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 13:28:55,528 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:55,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:55,540 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-15 13:28:55,734 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,SelfDestructingSolverStorable17 [2023-02-15 13:28:55,734 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash 430095051, now seen corresponding path program 1 times [2023-02-15 13:28:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:55,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021474644] [2023-02-15 13:28:55,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:56,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:56,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:56,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 13:28:56,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:56,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021474644] [2023-02-15 13:28:56,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021474644] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:56,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:56,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-15 13:28:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173595487] [2023-02-15 13:28:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:56,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 13:28:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:56,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 13:28:56,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:28:56,572 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:28:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:56,940 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2023-02-15 13:28:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:28:56,941 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2023-02-15 13:28:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:56,941 INFO L225 Difference]: With dead ends: 129 [2023-02-15 13:28:56,941 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 13:28:56,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:28:56,942 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 382 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:56,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 418 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:28:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 13:28:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2023-02-15 13:28:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.29) internal successors, (129), 118 states have internal predecessors, (129), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:28:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2023-02-15 13:28:56,945 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 52 [2023-02-15 13:28:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:56,945 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2023-02-15 13:28:56,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:28:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2023-02-15 13:28:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 13:28:56,946 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:56,946 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:56,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 13:28:56,946 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:28:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1004484877, now seen corresponding path program 1 times [2023-02-15 13:28:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:56,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49227064] [2023-02-15 13:28:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:57,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:57,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:57,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49227064] [2023-02-15 13:28:57,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49227064] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:57,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875857877] [2023-02-15 13:28:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:57,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:57,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:57,975 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-15 13:28:57,977 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-15 13:28:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:58,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 96 conjunts are in the unsatisfiable core [2023-02-15 13:28:58,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:58,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:58,422 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:58,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:28:58,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:58,602 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:58,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 13:28:58,723 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:58,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2023-02-15 13:28:58,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:28:58,731 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 7 treesize of output 3 [2023-02-15 13:28:58,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:58,921 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 13:28:58,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 35 [2023-02-15 13:28:58,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:58,925 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 36 treesize of output 29 [2023-02-15 13:28:58,936 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:28:58,936 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 15 treesize of output 15 [2023-02-15 13:28:59,030 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 35 treesize of output 23 [2023-02-15 13:28:59,162 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:59,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-15 13:28:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:28:59,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:59,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875857877] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:59,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:59,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2023-02-15 13:28:59,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617081147] [2023-02-15 13:28:59,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:59,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 13:28:59,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:59,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 13:28:59,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2484, Unknown=0, NotChecked=0, Total=2652 [2023-02-15 13:28:59,437 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand has 47 states, 43 states have (on average 1.813953488372093) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:29:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:29:00,737 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2023-02-15 13:29:00,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:29:00,737 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.813953488372093) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2023-02-15 13:29:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:29:00,738 INFO L225 Difference]: With dead ends: 126 [2023-02-15 13:29:00,738 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 13:29:00,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=335, Invalid=4087, Unknown=0, NotChecked=0, Total=4422 [2023-02-15 13:29:00,739 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 231 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:29:00,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1415 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 13:29:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 13:29:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2023-02-15 13:29:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.28) internal successors, (128), 118 states have internal predecessors, (128), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:29:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2023-02-15 13:29:00,743 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 54 [2023-02-15 13:29:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:29:00,743 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2023-02-15 13:29:00,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.813953488372093) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:29:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2023-02-15 13:29:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 13:29:00,744 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:29:00,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-15 13:29:00,750 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-15 13:29:00,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:29:00,949 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:29:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:29:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash 888325895, now seen corresponding path program 1 times [2023-02-15 13:29:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:29:00,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617719382] [2023-02-15 13:29:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:29:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:29:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:29:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:29:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:29:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 13:29:01,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:29:01,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617719382] [2023-02-15 13:29:01,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617719382] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:29:01,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:29:01,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:29:01,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164519879] [2023-02-15 13:29:01,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:29:01,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:29:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:29:01,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:29:01,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:29:01,320 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:29:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:29:01,575 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2023-02-15 13:29:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:29:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2023-02-15 13:29:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:29:01,576 INFO L225 Difference]: With dead ends: 145 [2023-02-15 13:29:01,576 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 13:29:01,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:29:01,577 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 214 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:29:01,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 402 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:29:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 13:29:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2023-02-15 13:29:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 109 states have internal predecessors, (118), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:29:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2023-02-15 13:29:01,580 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 57 [2023-02-15 13:29:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:29:01,581 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2023-02-15 13:29:01,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:29:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2023-02-15 13:29:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:29:01,582 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:29:01,582 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2023-02-15 13:29:01,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 13:29:01,582 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:29:01,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:29:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash 749733786, now seen corresponding path program 3 times [2023-02-15 13:29:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:29:01,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204321539] [2023-02-15 13:29:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:29:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:29:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:29:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:29:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 13:29:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 13:29:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-02-15 13:29:01,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:29:01,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204321539] [2023-02-15 13:29:01,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204321539] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:29:01,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138580766] [2023-02-15 13:29:01,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 13:29:01,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:29:01,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:29:01,689 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-15 13:29:01,700 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-15 13:29:02,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 13:29:02,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:29:02,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:29:02,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:29:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 13:29:02,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:29:02,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138580766] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:29:02,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:29:02,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-15 13:29:02,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007094577] [2023-02-15 13:29:02,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:29:02,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:29:02,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:29:02,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:29:02,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:29:02,028 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:29:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:29:02,038 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-02-15 13:29:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:29:02,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2023-02-15 13:29:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:29:02,039 INFO L225 Difference]: With dead ends: 84 [2023-02-15 13:29:02,040 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 13:29:02,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:29:02,041 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 130 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:29:02,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 94 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:29:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 13:29:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-15 13:29:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:29:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-15 13:29:02,045 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 58 [2023-02-15 13:29:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:29:02,046 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-15 13:29:02,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:29:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-15 13:29:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 13:29:02,046 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:29:02,046 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-15 13:29:02,056 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-15 13:29:02,253 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,SelfDestructingSolverStorable21 [2023-02-15 13:29:02,254 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:29:02,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:29:02,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1017304566, now seen corresponding path program 1 times [2023-02-15 13:29:02,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:29:02,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599909321] [2023-02-15 13:29:02,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:29:02,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:29:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:29:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:03,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:29:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:04,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:29:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:29:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:29:04,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599909321] [2023-02-15 13:29:04,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599909321] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:29:04,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197933419] [2023-02-15 13:29:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:29:04,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:29:04,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:29:04,492 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-15 13:29:04,493 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-15 13:29:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:04,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 148 conjunts are in the unsatisfiable core [2023-02-15 13:29:04,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:29:04,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:29:04,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:29:05,003 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:29:05,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:29:05,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:29:05,263 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:29:05,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-02-15 13:29:05,474 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:29:05,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2023-02-15 13:29:05,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:29:05,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:29:05,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:29:05,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:05,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 13:29:05,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:05,806 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 13:29:05,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 45 [2023-02-15 13:29:05,825 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:29:05,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 13:29:06,070 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 15 treesize of output 7 [2023-02-15 13:29:06,346 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-15 13:29:06,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 34 [2023-02-15 13:29:06,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 13:29:06,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:29:06,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:29:06,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:06,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:29:06,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:06,696 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 35 treesize of output 33 [2023-02-15 13:29:06,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:29:06,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:06,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:29:06,796 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 28 treesize of output 16 [2023-02-15 13:29:06,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:29:06,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:29:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:29:06,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:29:07,110 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2986 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2986) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-15 13:29:07,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:07,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 13:29:07,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:07,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 87 [2023-02-15 13:29:07,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:07,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 64 [2023-02-15 13:29:07,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-02-15 13:29:07,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:07,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 109 [2023-02-15 13:29:07,164 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 94 treesize of output 90 [2023-02-15 13:29:07,961 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse55 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147) (+ v_arrayElimCell_150 4))))) (.cse26 (not .cse2)) (.cse50 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse72 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse73 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse72 v_arrayElimCell_146) .cse73)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse72 v_arrayElimCell_147) .cse73)))))))) (let ((.cse7 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse71 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse69 (select .cse71 v_arrayElimCell_146))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse70 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse69 .cse70)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 v_arrayElimCell_147) .cse70)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse69 (+ v_arrayElimCell_149 4)))))))) (.cse9 (or .cse2 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146) (+ v_arrayElimCell_149 4)))))) (.cse12 (or .cse26 (and .cse50 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse67 (+ v_arrayElimCell_150 4)) (.cse66 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse66 v_arrayElimCell_146) .cse67)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse68 (select .cse66 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 .cse67))))))))))) (.cse13 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse65 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse61 (select .cse65 v_arrayElimCell_146)) (.cse64 (+ v_arrayElimCell_149 4))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse62 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse62)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse63 (select .cse65 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 .cse64)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 .cse62)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse64))))))) (.cse15 (or .cse2 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (let ((.cse60 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_arrayElimCell_149 4)))))))) (.cse16 (or .cse26 (and .cse55 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int) (v_arrayElimCell_149 Int)) (let ((.cse59 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_150 4))))))))) (.cse22 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse58 (+ v_arrayElimCell_150 4))) (or (= (select (select .cse57 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse58) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 v_arrayElimCell_147) .cse58))))))) (.cse27 (or .cse26 (and .cse55 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (let ((.cse56 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 (+ v_arrayElimCell_150 4)))))))))) (let ((.cse1 (and (or .cse2 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (let ((.cse43 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 (+ v_arrayElimCell_150 4))))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse44 (select .cse46 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse4)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse45 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse45)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 v_arrayElimCell_147) .cse45)))))))))) (or .cse26 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse48 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse47 (select .cse49 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse48))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse49 v_arrayElimCell_146) .cse48))))) .cse50)) (or .cse2 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146) .cse4)))) .cse27 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse54 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse51 (select .cse54 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse4)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse53 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse52 (select .cse54 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 .cse53))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse53))))))))))) (.cse6 (or (and .cse22 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse41 (+ v_arrayElimCell_150 4)) (.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (or (= (select (select .cse40 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse41) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (let ((.cse42 (select .cse40 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 .cse41))))))))) .cse26)) (.cse8 (or .cse2 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= (select .cse39 (+ v_arrayElimCell_150 4)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 (+ v_arrayElimCell_149 4)))))))) (.cse10 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse36 (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse37 (+ v_arrayElimCell_150 4))) (or (= (select .cse36 .cse37) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse38 v_arrayElimCell_147) .cse37)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 (+ v_arrayElimCell_149 4)))))))) (.cse11 (and .cse7 .cse9 .cse12 .cse13 .cse15 .cse16)) (.cse5 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse14 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse34 (+ v_arrayElimCell_149 4))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse32 (+ v_arrayElimCell_150 4))) (or (= (select .cse31 .cse32) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (let ((.cse33 (select .cse35 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse34)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse32)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse34))))))) (.cse17 (or .cse2 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_149 4)))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or .cse0 .cse1) (or .cse2 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse4)) (= (select .cse3 (+ v_arrayElimCell_150 4)) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse5 .cse1) (or .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 (or .cse11 .cse0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 .cse4)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse20 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse19 (select .cse21 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 .cse20))))) (= (select .cse18 .cse20) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or .cse2 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse4)))) (or (and .cse22 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse24 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse23 (select .cse25 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 .cse24))))) (= (select (select .cse25 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse24) |c_ULTIMATE.start_main_~data~0#1|))))) .cse26) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (or .cse11 .cse5) .cse13 .cse14 .cse15 .cse16 .cse17) .cse0) .cse27 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse28 (select .cse30 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse29 (+ v_arrayElimCell_150 4))) (or (= (select .cse28 .cse29) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 v_arrayElimCell_147) .cse29)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 .cse4))))))))))) is different from false [2023-02-15 13:29:10,925 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse19 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse37 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse73 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse74 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse73 v_arrayElimCell_146) .cse74)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse73 v_arrayElimCell_147) .cse74))))))) (.cse27 (not .cse21)) (.cse17 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse67 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147) (+ v_arrayElimCell_150 4)))))) (let ((.cse22 (or .cse27 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (let ((.cse72 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse72 .cse17)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse72 (+ v_arrayElimCell_150 4)))))) .cse67))) (.cse5 (or .cse21 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (let ((.cse71 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse71 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse71 (+ v_arrayElimCell_150 4)))))))) (.cse6 (or .cse21 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146) (+ v_arrayElimCell_149 4)))))) (.cse7 (or (and .cse37 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse70 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse69 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse68 (select .cse70 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 .cse69)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 (+ v_arrayElimCell_149 4)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse70 v_arrayElimCell_146) .cse69)))))) .cse27)) (.cse8 (or .cse27 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int) (v_arrayElimCell_149 Int)) (let ((.cse66 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (+ v_arrayElimCell_149 4)))))) .cse67))) (.cse9 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse65 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse63 (select .cse65 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 (+ v_arrayElimCell_149 4))) (forall ((v_arrayElimCell_150 Int)) (let ((.cse64 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 .cse64)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_147) .cse64))))))))))) (.cse11 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse62 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse59 (+ v_arrayElimCell_149 4)) (.cse58 (select .cse62 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse59)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse61 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse60 (select .cse62 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse61)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse59))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse61)))))))))) (.cse26 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse57 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse56 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse57)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse56 v_arrayElimCell_147) .cse57)))))))) (let ((.cse3 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse53 (+ v_arrayElimCell_149 4))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse52 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse51 (select .cse54 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse52)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse53))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 .cse52))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 .cse53))))))) (.cse4 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse48 (select .cse50 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 (+ v_arrayElimCell_149 4))) (forall ((v_arrayElimCell_150 Int)) (let ((.cse49 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse49)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_147) .cse49))))))))))) (.cse10 (or .cse27 (and .cse26 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse46 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse45 (select .cse47 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse46)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 (+ v_arrayElimCell_149 4)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse46)))))))) (.cse12 (or .cse21 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse44 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 (+ v_arrayElimCell_149 4)))))))) (.cse1 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse11)) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (or .cse21 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_149 4)))))) (.cse20 (and (or .cse21 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (let ((.cse32 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 .cse17)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 (+ v_arrayElimCell_150 4))))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse33 (select .cse36 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse17)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse34 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse34)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse35 (select .cse36 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 .cse17)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 .cse34)))))))))))) (or .cse27 (and .cse37 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse39 (+ v_arrayElimCell_150 4)) (.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse38 v_arrayElimCell_146) .cse39)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse40 (select .cse38 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 .cse17)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 .cse39)))))))))) .cse22 (or .cse21 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146) .cse17)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse41 (select .cse43 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 .cse17)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse42 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 .cse42)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 v_arrayElimCell_147) .cse42)))))))))))) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (or .cse0 (and (or .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse14 (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse15 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse15)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse16 (select .cse18 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 .cse17)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 .cse15)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse17)))))) (or .cse20 .cse0) (or .cse21 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse17)))) .cse22 (or (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse24 (+ v_arrayElimCell_150 4)) (.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse24)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse25 (select .cse23 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 .cse17)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 .cse24)))))))) .cse26) .cse27) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse1 .cse0) .cse13) .cse2) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse28 (select .cse30 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 .cse17)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse29 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 .cse29)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 v_arrayElimCell_147) .cse29)))))))))) (or .cse20 .cse2) (or .cse21 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse17)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 (+ v_arrayElimCell_150 4)))))))))))) is different from false [2023-02-15 13:29:13,861 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse55 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse73 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988)) (.cse74 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse73 v_arrayElimCell_146) .cse74)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse73 v_arrayElimCell_147) .cse74))))))) (.cse27 (not .cse23)) (.cse56 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_147) (+ v_arrayElimCell_150 4)))))) (let ((.cse28 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse71 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988)) (.cse72 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 v_arrayElimCell_147) .cse72))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse72)))))) (.cse12 (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (let ((.cse70 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 (+ v_arrayElimCell_149 4)))))) .cse23)) (.cse13 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse69 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse67 (select .cse69 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 (+ v_arrayElimCell_149 4))) (forall ((v_arrayElimCell_150 Int)) (let ((.cse68 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 .cse68)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse69 v_arrayElimCell_147) .cse68))))))))))) (.cse14 (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_146) (+ v_arrayElimCell_149 4)))) .cse23)) (.cse16 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse66 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse62 (select .cse66 v_arrayElimCell_146)) (.cse63 (+ v_arrayElimCell_149 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 .cse63)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse64 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 .cse64)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse65 (select .cse66 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 .cse63)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 .cse64))))))))))))) (.cse17 (or .cse27 (and .cse56 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int) (v_arrayElimCell_149 Int)) (let ((.cse61 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_arrayElimCell_150 4))))))))) (.cse21 (or .cse27 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse59 (+ v_arrayElimCell_150 4)) (.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse58 v_arrayElimCell_146) .cse59)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse60 (select .cse58 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse59)))))))) .cse55))) (.cse2 (or .cse27 (and .cse56 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (let ((.cse57 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_arrayElimCell_150 4)))))))))) (let ((.cse0 (and .cse2 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse44 (select .cse47 v_arrayElimCell_146))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse45 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse45)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse46 (select .cse47 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse45)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse4)))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse48 (select .cse50 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse4)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse49 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse49)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_147) .cse49)))))))))) (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (let ((.cse51 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse4))))) .cse23) (or .cse27 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse53 (+ v_arrayElimCell_150 4)) (.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 v_arrayElimCell_146) .cse53)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse54 (select .cse52 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse54 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse54 .cse53)))))))) .cse55)) (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_146) .cse4))) .cse23))) (.cse9 (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse43 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 (+ v_arrayElimCell_150 4)))))) .cse23)) (.cse15 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse39 (+ v_arrayElimCell_149 4)) (.cse38 (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 .cse39)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse41 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse40 (select .cse42 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 .cse39)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 .cse41))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 .cse41)))))))))) (.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (and .cse12 .cse13 .cse14 .cse16 .cse17 .cse21)) (.cse18 (or .cse27 (and .cse28 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988)) (.cse36 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse35 (select .cse37 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 .cse36))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse36)))))))) (.cse19 (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_149 4)))) .cse23)) (.cse20 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse34 (select .cse32 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse33 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse32 v_arrayElimCell_147) .cse33))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 .cse33))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 (+ v_arrayElimCell_149 4)))))))) (.cse10 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (or .cse0 .cse1) .cse2 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse5 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse3 (select .cse6 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse5))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse5))))) (= (select .cse7 .cse4) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse1 (and .cse9 (or .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= (select .cse22 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 (+ v_arrayElimCell_150 4)))))) .cse23) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse26 (select .cse24 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse25 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 v_arrayElimCell_147) .cse25))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 .cse25))))) (= (select .cse26 .cse4) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse0 .cse10) (or .cse27 (and .cse28 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988)) (.cse30 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse29 (select .cse31 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse30))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse30))))))) (or (and .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 (or .cse1 .cse11) .cse17 .cse18 .cse19 .cse20 .cse21) .cse10) (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse4) |c_ULTIMATE.start_main_~data~0#1|)) .cse23)))))) is different from false [2023-02-15 13:29:33,827 WARN L233 SmtUtils]: Spent 10.78s on a formula simplification. DAG size of input: 139 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:29:34,091 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|))) (and (or (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse0 (select .cse4 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse2 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse2)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse3 (select .cse4 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse1)))))))))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse1))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse8 (select .cse10 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse1)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse9 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse9)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 v_arrayElimCell_147) .cse9)))))))))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= (select .cse11 (+ v_arrayElimCell_150 4)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse1)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse13 (+ v_arrayElimCell_150 4))) (or (= (select .cse12 .cse13) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_147) .cse13)))))))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse15 (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 .cse1)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse16 (+ v_arrayElimCell_150 4))) (or (= (select .cse15 .cse16) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (let ((.cse17 (select .cse18 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 .cse16)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 .cse1)))))))))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse1))) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-02-15 13:29:34,165 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (or (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse0 (select .cse4 v_arrayElimCell_146))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse1 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse2 (select .cse4 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse3)))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse7 (select .cse8 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse3)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse9 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 v_arrayElimCell_147) .cse9))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse9))))))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_150 4)))))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse3) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse12 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse11 (select .cse13 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse12)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse3))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse12))))) (= (select .cse14 .cse3) |c_ULTIMATE.start_main_~data~0#1|))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 (+ v_arrayElimCell_150 4))) (= (select .cse15 .cse3) |c_ULTIMATE.start_main_~data~0#1|)))) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse18 (select .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse17 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_147) .cse17))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 .cse17))))) (= (select .cse18 .cse3) |c_ULTIMATE.start_main_~data~0#1|))))))) is different from false [2023-02-15 13:29:34,353 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse3 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse2 (select .cse4 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse3))))))))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 (+ v_arrayElimCell_150 4)))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse8 (select .cse11 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse1)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse10 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse9 (select .cse11 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse10)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse10))))))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse14 (select .cse12 v_arrayElimCell_146))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse13 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_147) .cse13))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse13))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse1)))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 .cse1))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse1))) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse18 (select .cse16 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse17 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_147) .cse17))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 .cse17))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 .cse1)))))))) is different from false [2023-02-15 13:29:34,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:34,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 915 treesize of output 1008 [2023-02-15 13:29:35,037 INFO L321 Elim1Store]: treesize reduction 628, result has 14.7 percent of original size [2023-02-15 13:29:35,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 40 case distinctions, treesize of input 8085 treesize of output 8120 [2023-02-15 13:29:35,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:35,101 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 7921 treesize of output 7714 [2023-02-15 13:29:35,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:35,158 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 7705 treesize of output 7606 [2023-02-15 13:29:35,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:35,218 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 7604 treesize of output 7556 [2023-02-15 13:29:35,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:35,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 9513 treesize of output 9709 [2023-02-15 13:29:35,720 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:35,721 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 9368 treesize of output 9289 [2023-02-15 13:29:35,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:35,809 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 9280 treesize of output 9277 [2023-02-15 13:29:35,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:35,895 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 9268 treesize of output 9101 [2023-02-15 13:29:36,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:36,022 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 9092 treesize of output 9077 [2023-02-15 13:29:36,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:36,137 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 9075 treesize of output 9075 [2023-02-15 13:29:36,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:36,264 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 9062 treesize of output 9059 [2023-02-15 13:29:36,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:36,390 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 9050 treesize of output 9035 [2023-02-15 13:29:36,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:36,484 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 9026 treesize of output 9023 [2023-02-15 13:29:36,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:36,594 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 9014 treesize of output 9017 [2023-02-15 13:29:36,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:36,709 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 9008 treesize of output 8941 [2023-02-15 13:29:36,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:36,816 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 8932 treesize of output 8903 [2023-02-15 13:29:36,920 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 8894 treesize of output 8890 [2023-02-15 13:29:37,022 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 8890 treesize of output 8882