./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 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/sll2n_append_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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:56:50,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:56:50,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:56:50,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:56:50,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:56:50,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:56:50,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:56:50,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:56:50,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:56:50,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:56:50,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:56:50,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:56:50,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:56:50,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:56:50,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:56:50,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:56:50,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:56:50,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:56:50,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:56:50,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:56:50,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:56:50,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:56:50,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:56:50,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:56:50,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:56:50,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:56:50,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:56:50,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:56:50,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:56:50,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:56:50,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:56:50,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:56:50,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:56:50,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:56:50,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:56:50,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:56:50,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:56:50,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:56:50,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:56:50,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:56:50,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:56:50,165 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:56:50,187 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:56:50,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:56:50,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:56:50,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:56:50,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:56:50,189 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:56:50,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:56:50,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:56:50,189 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:56:50,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:56:50,190 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:56:50,190 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:56:50,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:56:50,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:56:50,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:56:50,191 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:56:50,191 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:56:50,191 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:56:50,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:56:50,191 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:56:50,191 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:56:50,191 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:56:50,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:56:50,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:56:50,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:56:50,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:56:50,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:56:50,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:56:50,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:56:50,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:56:50,193 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:56:50,193 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:56:50,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:56:50,193 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:56:50,193 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-02-14 13:56:50,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:56:50,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:56:50,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:56:50,415 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:56:50,416 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:56:50,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-14 13:56:51,525 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:56:51,759 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:56:51,760 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-14 13:56:51,787 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f8124db/a7cb26a521a14a849cb5e534a07f9043/FLAGa5ae11ab6 [2023-02-14 13:56:51,807 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f8124db/a7cb26a521a14a849cb5e534a07f9043 [2023-02-14 13:56:51,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:56:51,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:56:51,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:56:51,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:56:51,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:56:51,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:56:51" (1/1) ... [2023-02-14 13:56:51,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286a96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:51, skipping insertion in model container [2023-02-14 13:56:51,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:56:51" (1/1) ... [2023-02-14 13:56:51,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:56:51,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:56:52,129 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/sll2n_append_equal.i[24197,24210] [2023-02-14 13:56:52,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:56:52,145 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:56:52,203 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/sll2n_append_equal.i[24197,24210] [2023-02-14 13:56:52,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:56:52,224 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:56:52,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52 WrapperNode [2023-02-14 13:56:52,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:56:52,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:56:52,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:56:52,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:56:52,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,262 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-02-14 13:56:52,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:56:52,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:56:52,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:56:52,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:56:52,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,294 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:56:52,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:56:52,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:56:52,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:56:52,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (1/1) ... [2023-02-14 13:56:52,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:56:52,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:52,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 13:56:52,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 13:56:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:56:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:56:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-14 13:56:52,386 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-14 13:56:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:56:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 13:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 13:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:56:52,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:56:52,506 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:56:52,508 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:56:52,730 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:56:52,735 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:56:52,735 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 13:56:52,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:56:52 BoogieIcfgContainer [2023-02-14 13:56:52,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:56:52,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:56:52,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:56:52,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:56:52,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:56:51" (1/3) ... [2023-02-14 13:56:52,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4f16fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:56:52, skipping insertion in model container [2023-02-14 13:56:52,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:52" (2/3) ... [2023-02-14 13:56:52,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4f16fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:56:52, skipping insertion in model container [2023-02-14 13:56:52,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:56:52" (3/3) ... [2023-02-14 13:56:52,745 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-02-14 13:56:52,757 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:56:52,757 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-02-14 13:56:52,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:56:52,795 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;@566856bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:56:52,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-02-14 13:56:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:56:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 13:56:52,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:52,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:52,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:56:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904761, now seen corresponding path program 1 times [2023-02-14 13:56:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:52,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568536192] [2023-02-14 13:56:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:53,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:53,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568536192] [2023-02-14 13:56:53,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568536192] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:53,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:53,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:56:53,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136464481] [2023-02-14 13:56:53,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:53,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:56:53,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:53,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:56:53,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:56:53,098 INFO L87 Difference]: Start difference. First operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 13:56:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:53,189 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-02-14 13:56:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:56:53,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2023-02-14 13:56:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:53,196 INFO L225 Difference]: With dead ends: 83 [2023-02-14 13:56:53,197 INFO L226 Difference]: Without dead ends: 80 [2023-02-14 13:56:53,198 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-14 13:56:53,203 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:53,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-14 13:56:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-14 13:56:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:56:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-02-14 13:56:53,233 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 7 [2023-02-14 13:56:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:53,234 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-02-14 13:56:53,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 13:56:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-02-14 13:56:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 13:56:53,234 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:53,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:53,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:56:53,235 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:56:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904762, now seen corresponding path program 1 times [2023-02-14 13:56:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:53,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816960848] [2023-02-14 13:56:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:53,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:53,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816960848] [2023-02-14 13:56:53,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816960848] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:53,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:53,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:56:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781379782] [2023-02-14 13:56:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:53,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:56:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:56:53,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:56:53,314 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 13:56:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:53,353 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-02-14 13:56:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:56:53,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2023-02-14 13:56:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:53,355 INFO L225 Difference]: With dead ends: 78 [2023-02-14 13:56:53,355 INFO L226 Difference]: Without dead ends: 78 [2023-02-14 13:56:53,355 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-14 13:56:53,356 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:53,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:56:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-14 13:56:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-14 13:56:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:56:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2023-02-14 13:56:53,361 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2023-02-14 13:56:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:53,362 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2023-02-14 13:56:53,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 13:56:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2023-02-14 13:56:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 13:56:53,363 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:53,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:53,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:56:53,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:56:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:53,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810752, now seen corresponding path program 1 times [2023-02-14 13:56:53,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:53,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670080623] [2023-02-14 13:56:53,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:53,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:56:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:53,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:53,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670080623] [2023-02-14 13:56:53,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670080623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:53,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:53,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:56:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300582340] [2023-02-14 13:56:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:53,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:56:53,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:56:53,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:56:53,499 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-14 13:56:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:53,633 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2023-02-14 13:56:53,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:56:53,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-14 13:56:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:53,635 INFO L225 Difference]: With dead ends: 82 [2023-02-14 13:56:53,635 INFO L226 Difference]: Without dead ends: 82 [2023-02-14 13:56:53,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-14 13:56:53,636 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:53,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-14 13:56:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2023-02-14 13:56:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:56:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-14 13:56:53,643 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 13 [2023-02-14 13:56:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:53,643 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-14 13:56:53,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-14 13:56:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-14 13:56:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 13:56:53,644 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:53,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:53,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:56:53,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:56:53,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:53,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810753, now seen corresponding path program 1 times [2023-02-14 13:56:53,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:53,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531847025] [2023-02-14 13:56:53,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:53,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:53,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:56:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:53,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:53,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531847025] [2023-02-14 13:56:53,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531847025] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:53,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:53,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:56:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91087460] [2023-02-14 13:56:53,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:53,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:56:53,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:53,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:56:53,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:56:53,912 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-14 13:56:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:54,079 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-02-14 13:56:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:56:54,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-14 13:56:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:54,081 INFO L225 Difference]: With dead ends: 81 [2023-02-14 13:56:54,081 INFO L226 Difference]: Without dead ends: 81 [2023-02-14 13:56:54,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:56:54,087 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:54,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 316 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-14 13:56:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-02-14 13:56:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:56:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-02-14 13:56:54,097 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2023-02-14 13:56:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:54,097 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-02-14 13:56:54,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-14 13:56:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-02-14 13:56:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 13:56:54,098 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:54,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:54,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:56:54,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:56:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1399608384, now seen corresponding path program 1 times [2023-02-14 13:56:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:54,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903242648] [2023-02-14 13:56:54,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:54,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:54,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 13:56:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:54,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:54,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903242648] [2023-02-14 13:56:54,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903242648] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:54,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:54,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:56:54,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090161388] [2023-02-14 13:56:54,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:54,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:56:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:54,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:56:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:56:54,181 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-14 13:56:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:54,234 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-02-14 13:56:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:56:54,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2023-02-14 13:56:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:54,236 INFO L225 Difference]: With dead ends: 82 [2023-02-14 13:56:54,236 INFO L226 Difference]: Without dead ends: 82 [2023-02-14 13:56:54,236 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-14 13:56:54,239 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:54,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 192 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:56:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-14 13:56:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2023-02-14 13:56:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:56:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-14 13:56:54,254 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 15 [2023-02-14 13:56:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:54,254 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-14 13:56:54,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-14 13:56:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-14 13:56:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 13:56:54,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:54,256 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:54,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 13:56:54,257 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:56:54,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:54,258 INFO L85 PathProgramCache]: Analyzing trace with hash -898428094, now seen corresponding path program 1 times [2023-02-14 13:56:54,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:54,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996856364] [2023-02-14 13:56:54,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:54,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:54,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:56:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:54,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 13:56:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:56:54,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:54,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996856364] [2023-02-14 13:56:54,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996856364] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:54,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803581830] [2023-02-14 13:56:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:54,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:54,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:54,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:56:54,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 13:56:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:54,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 13:56:54,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:54,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:56:54,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803581830] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:56:54,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:56:54,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-14 13:56:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553173634] [2023-02-14 13:56:54,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:54,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:56:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:54,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:56:54,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:56:54,559 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:56:54,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:54,610 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-02-14 13:56:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:56:54,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-02-14 13:56:54,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:54,611 INFO L225 Difference]: With dead ends: 83 [2023-02-14 13:56:54,611 INFO L226 Difference]: Without dead ends: 83 [2023-02-14 13:56:54,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:56:54,612 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:54,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 267 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:56:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-14 13:56:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-14 13:56:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 78 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-14 13:56:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2023-02-14 13:56:54,615 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 28 [2023-02-14 13:56:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:54,615 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2023-02-14 13:56:54,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:56:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2023-02-14 13:56:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:56:54,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:54,617 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:54,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:54,822 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-14 13:56:54,823 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:56:54,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:54,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186176, now seen corresponding path program 2 times [2023-02-14 13:56:54,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:54,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952574752] [2023-02-14 13:56:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:54,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:56:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:56:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:55,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:56:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-14 13:56:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:55,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952574752] [2023-02-14 13:56:55,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952574752] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:55,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:55,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:56:55,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970954851] [2023-02-14 13:56:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:55,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:56:55,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:55,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:56:55,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:56:55,195 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:56:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:55,307 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2023-02-14 13:56:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:56:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2023-02-14 13:56:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:55,308 INFO L225 Difference]: With dead ends: 90 [2023-02-14 13:56:55,308 INFO L226 Difference]: Without dead ends: 90 [2023-02-14 13:56:55,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:56:55,309 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 110 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:55,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 173 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-14 13:56:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-02-14 13:56:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 73 states have internal predecessors, (79), 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-14 13:56:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-02-14 13:56:55,312 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 41 [2023-02-14 13:56:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:55,312 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-02-14 13:56:55,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:56:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-02-14 13:56:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:56:55,313 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:55,313 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:55,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 13:56:55,314 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:56:55,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186175, now seen corresponding path program 1 times [2023-02-14 13:56:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:55,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260459063] [2023-02-14 13:56:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:55,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:55,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:56:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:55,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:56:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:55,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:56:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 13:56:55,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:55,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260459063] [2023-02-14 13:56:55,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260459063] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:55,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524107813] [2023-02-14 13:56:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:55,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:55,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:55,726 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:56:55,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 13:56:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:55,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 13:56:55,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:55,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:56:55,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:56:55,933 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_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2023-02-14 13:56:56,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:56,024 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-14 13:56:56,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:56:56,075 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_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2023-02-14 13:56:56,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:56,131 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-14 13:56:56,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:56:56,188 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_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2023-02-14 13:56:56,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:56,219 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-14 13:56:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2023-02-14 13:56:56,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:56,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524107813] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:56,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:56,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2023-02-14 13:56:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761511227] [2023-02-14 13:56:56,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:56,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 13:56:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 13:56:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=220, Unknown=3, NotChecked=96, Total=380 [2023-02-14 13:56:56,313 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 18 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:56:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:56,507 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-02-14 13:56:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:56:56,507 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-02-14 13:56:56,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:56,508 INFO L225 Difference]: With dead ends: 85 [2023-02-14 13:56:56,508 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 13:56:56,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=268, Unknown=3, NotChecked=108, Total=462 [2023-02-14 13:56:56,509 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 313 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:56,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 186 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 0 Unknown, 198 Unchecked, 0.1s Time] [2023-02-14 13:56:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 13:56:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2023-02-14 13:56:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 68 states have internal predecessors, (74), 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-14 13:56:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2023-02-14 13:56:56,511 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2023-02-14 13:56:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:56,512 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2023-02-14 13:56:56,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:56:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2023-02-14 13:56:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 13:56:56,513 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:56,513 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:56,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:56,718 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,SelfDestructingSolverStorable7 [2023-02-14 13:56:56,718 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:56:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:56,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253767, now seen corresponding path program 1 times [2023-02-14 13:56:56,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:56,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164945542] [2023-02-14 13:56:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:56:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:57,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:56:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:57,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:56:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:56:57,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:57,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164945542] [2023-02-14 13:56:57,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164945542] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:57,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775873208] [2023-02-14 13:56:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:57,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:57,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:57,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:56:57,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 13:56:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:57,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 13:56:57,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:57,846 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-14 13:56:57,849 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-14 13:56:57,954 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_615)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_616)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 13:56:57,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:57,998 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 25 treesize of output 25 [2023-02-14 13:56:58,010 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:56:58,011 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-14 13:56:58,015 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 18 treesize of output 13 [2023-02-14 13:56:58,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:58,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:56:58,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:56:58,066 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-14 13:56:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-14 13:56:58,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:58,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775873208] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:58,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:58,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2023-02-14 13:56:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816246207] [2023-02-14 13:56:58,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:58,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 13:56:58,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:58,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 13:56:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2023-02-14 13:56:58,348 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:56:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:59,387 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2023-02-14 13:56:59,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 13:56:59,388 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2023-02-14 13:56:59,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:59,389 INFO L225 Difference]: With dead ends: 112 [2023-02-14 13:56:59,389 INFO L226 Difference]: Without dead ends: 112 [2023-02-14 13:56:59,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2023-02-14 13:56:59,390 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 343 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:59,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 924 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 996 Invalid, 0 Unknown, 104 Unchecked, 0.5s Time] [2023-02-14 13:56:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-14 13:56:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2023-02-14 13:56:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 72 states have internal predecessors, (82), 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-14 13:56:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2023-02-14 13:56:59,392 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 45 [2023-02-14 13:56:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:59,393 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2023-02-14 13:56:59,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:56:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2023-02-14 13:56:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 13:56:59,418 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:59,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:59,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:59,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:59,619 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:56:59,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253766, now seen corresponding path program 1 times [2023-02-14 13:56:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:59,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914283795] [2023-02-14 13:56:59,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:59,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:56:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:56:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:59,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:56:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:57:00,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:00,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914283795] [2023-02-14 13:57:00,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914283795] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:00,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943331049] [2023-02-14 13:57:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:00,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:00,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:00,029 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:00,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 13:57:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:00,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 13:57:00,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:00,315 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-14 13:57:00,389 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_784 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_784) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-14 13:57:00,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:00,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:57:00,415 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-14 13:57:00,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:57:00,465 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-14 13:57:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 13:57:00,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:57:00,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943331049] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:00,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:57:00,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-14 13:57:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892531341] [2023-02-14 13:57:00,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:00,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 13:57:00,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 13:57:00,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-14 13:57:00,476 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:57:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:00,747 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-02-14 13:57:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 13:57:00,747 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2023-02-14 13:57:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:00,748 INFO L225 Difference]: With dead ends: 104 [2023-02-14 13:57:00,748 INFO L226 Difference]: Without dead ends: 104 [2023-02-14 13:57:00,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2023-02-14 13:57:00,749 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:00,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 518 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 3 Unknown, 120 Unchecked, 0.2s Time] [2023-02-14 13:57:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-14 13:57:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2023-02-14 13:57:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 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-14 13:57:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-14 13:57:00,751 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2023-02-14 13:57:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:00,751 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-14 13:57:00,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:57:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-14 13:57:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 13:57:00,752 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:00,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:00,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:00,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:00,958 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -35949242, now seen corresponding path program 1 times [2023-02-14 13:57:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:00,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065369911] [2023-02-14 13:57:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:00,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-14 13:57:01,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:01,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065369911] [2023-02-14 13:57:01,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065369911] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:01,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:01,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 13:57:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682333595] [2023-02-14 13:57:01,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:01,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:57:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:01,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:57:01,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:57:01,127 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:57:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:01,313 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2023-02-14 13:57:01,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 13:57:01,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2023-02-14 13:57:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:01,316 INFO L225 Difference]: With dead ends: 136 [2023-02-14 13:57:01,316 INFO L226 Difference]: Without dead ends: 136 [2023-02-14 13:57:01,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-14 13:57:01,317 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 164 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:01,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 310 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:57:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-14 13:57:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2023-02-14 13:57:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.360655737704918) internal successors, (83), 74 states have internal predecessors, (83), 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-14 13:57:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-02-14 13:57:01,320 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 48 [2023-02-14 13:57:01,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:01,321 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-02-14 13:57:01,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:57:01,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-02-14 13:57:01,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 13:57:01,324 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:01,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:01,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 13:57:01,324 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:01,325 INFO L85 PathProgramCache]: Analyzing trace with hash -35949241, now seen corresponding path program 1 times [2023-02-14 13:57:01,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:01,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979870344] [2023-02-14 13:57:01,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:01,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-14 13:57:01,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:01,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979870344] [2023-02-14 13:57:01,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979870344] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:01,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:01,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 13:57:01,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562693516] [2023-02-14 13:57:01,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:01,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:57:01,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:01,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:57:01,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:57:01,619 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:57:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:01,767 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2023-02-14 13:57:01,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 13:57:01,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2023-02-14 13:57:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:01,768 INFO L225 Difference]: With dead ends: 126 [2023-02-14 13:57:01,768 INFO L226 Difference]: Without dead ends: 126 [2023-02-14 13:57:01,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-14 13:57:01,769 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 150 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:01,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 323 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:57:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-14 13:57:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2023-02-14 13:57:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 76 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-14 13:57:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-02-14 13:57:01,771 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 48 [2023-02-14 13:57:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:01,771 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-02-14 13:57:01,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:57:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-02-14 13:57:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 13:57:01,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:01,771 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:01,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 13:57:01,772 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:01,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1114427801, now seen corresponding path program 1 times [2023-02-14 13:57:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:01,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625046269] [2023-02-14 13:57:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-14 13:57:01,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:01,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625046269] [2023-02-14 13:57:01,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625046269] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:01,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:57:01,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 13:57:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902259617] [2023-02-14 13:57:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:01,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:57:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:01,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:57:01,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:57:01,983 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:57:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:02,143 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2023-02-14 13:57:02,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 13:57:02,143 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2023-02-14 13:57:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:02,157 INFO L225 Difference]: With dead ends: 109 [2023-02-14 13:57:02,157 INFO L226 Difference]: Without dead ends: 109 [2023-02-14 13:57:02,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-14 13:57:02,158 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 152 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:02,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 508 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:57:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-14 13:57:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2023-02-14 13:57:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 76 states have internal predecessors, (83), 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-14 13:57:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-02-14 13:57:02,160 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 49 [2023-02-14 13:57:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:02,160 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-02-14 13:57:02,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:57:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-02-14 13:57:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 13:57:02,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:02,161 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:02,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 13:57:02,161 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:02,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:02,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828739, now seen corresponding path program 1 times [2023-02-14 13:57:02,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:02,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278926147] [2023-02-14 13:57:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:02,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:02,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:03,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:57:03,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:03,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278926147] [2023-02-14 13:57:03,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278926147] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:03,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817908526] [2023-02-14 13:57:03,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:03,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:03,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:03,625 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:03,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 13:57:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:03,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 104 conjunts are in the unsatisfiable core [2023-02-14 13:57:03,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:04,078 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:57:04,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 13:57:04,087 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 14 treesize of output 16 [2023-02-14 13:57:04,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:57:04,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:57:04,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:04,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 38 [2023-02-14 13:57:04,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:04,500 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2023-02-14 13:57:04,667 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1257 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1257))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1261 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1261) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1260 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1260) |c_#memory_$Pointer$.base|)))) is different from true [2023-02-14 13:57:04,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:04,743 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:57:04,743 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 81 treesize of output 69 [2023-02-14 13:57:04,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:04,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:04,753 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 13:57:04,753 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 50 treesize of output 49 [2023-02-14 13:57:04,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:04,759 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 30 treesize of output 32 [2023-02-14 13:57:04,774 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:57:04,775 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-14 13:57:05,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:05,010 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:05,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:05,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 47 [2023-02-14 13:57:05,017 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-14 13:57:05,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 3 case distinctions, treesize of input 41 treesize of output 27 [2023-02-14 13:57:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-14 13:57:05,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:05,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817908526] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:05,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:05,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 48 [2023-02-14 13:57:05,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106321330] [2023-02-14 13:57:05,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:05,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-14 13:57:05,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-14 13:57:05,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2496, Unknown=2, NotChecked=100, Total=2756 [2023-02-14 13:57:05,336 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 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-14 13:57:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:10,119 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2023-02-14 13:57:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-14 13:57:10,119 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 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 49 [2023-02-14 13:57:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:10,120 INFO L225 Difference]: With dead ends: 183 [2023-02-14 13:57:10,120 INFO L226 Difference]: Without dead ends: 183 [2023-02-14 13:57:10,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=698, Invalid=5466, Unknown=2, NotChecked=154, Total=6320 [2023-02-14 13:57:10,122 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1320 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:10,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 1347 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1997 Invalid, 0 Unknown, 162 Unchecked, 1.3s Time] [2023-02-14 13:57:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-14 13:57:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 80. [2023-02-14 13:57:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.296875) internal successors, (83), 75 states have internal predecessors, (83), 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-14 13:57:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2023-02-14 13:57:10,129 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 49 [2023-02-14 13:57:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:10,129 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2023-02-14 13:57:10,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 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-14 13:57:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2023-02-14 13:57:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 13:57:10,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:10,130 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:10,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:10,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-14 13:57:10,337 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828740, now seen corresponding path program 1 times [2023-02-14 13:57:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:10,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694199242] [2023-02-14 13:57:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:57:11,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:11,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694199242] [2023-02-14 13:57:11,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694199242] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:11,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465100737] [2023-02-14 13:57:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:11,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:11,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:11,590 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:11,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 13:57:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:11,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-14 13:57:11,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:11,957 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-14 13:57:11,957 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 19 treesize of output 16 [2023-02-14 13:57:12,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:57:12,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:12,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:12,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 18 [2023-02-14 13:57:12,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:57:12,458 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1433 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1433))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1434 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1434))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-14 13:57:12,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:12,491 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:57:12,491 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 57 treesize of output 55 [2023-02-14 13:57:12,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:12,496 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 62 treesize of output 58 [2023-02-14 13:57:12,521 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2023-02-14 13:57:12,521 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 69 [2023-02-14 13:57:12,647 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 81 treesize of output 57 [2023-02-14 13:57:12,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:12,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:12,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 29 [2023-02-14 13:57:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-14 13:57:12,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:13,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465100737] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:13,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:13,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2023-02-14 13:57:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710250308] [2023-02-14 13:57:13,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:13,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 13:57:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:13,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 13:57:13,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2177, Unknown=2, NotChecked=94, Total=2450 [2023-02-14 13:57:13,110 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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-14 13:57:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:15,398 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2023-02-14 13:57:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 13:57:15,399 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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 49 [2023-02-14 13:57:15,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:15,400 INFO L225 Difference]: With dead ends: 122 [2023-02-14 13:57:15,400 INFO L226 Difference]: Without dead ends: 122 [2023-02-14 13:57:15,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=528, Invalid=4164, Unknown=4, NotChecked=134, Total=4830 [2023-02-14 13:57:15,401 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 599 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:15,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1353 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1561 Invalid, 3 Unknown, 109 Unchecked, 0.9s Time] [2023-02-14 13:57:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-14 13:57:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 80. [2023-02-14 13:57:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 75 states have internal predecessors, (82), 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-14 13:57:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-02-14 13:57:15,403 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 49 [2023-02-14 13:57:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:15,404 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-02-14 13:57:15,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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-14 13:57:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-02-14 13:57:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 13:57:15,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:15,404 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:15,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:15,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 13:57:15,612 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash 218878957, now seen corresponding path program 1 times [2023-02-14 13:57:15,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:15,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686465821] [2023-02-14 13:57:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:15,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:15,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:15,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:57:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686465821] [2023-02-14 13:57:15,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686465821] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250191939] [2023-02-14 13:57:15,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:15,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:15,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:15,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 13:57:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:16,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-14 13:57:16,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:16,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:57:16,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:57:16,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:57:16,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:16,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 13:57:16,442 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-14 13:57:16,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:57:16,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:57:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-14 13:57:16,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:57:16,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250191939] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:57:16,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:57:16,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2023-02-14 13:57:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20394327] [2023-02-14 13:57:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:57:16,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 13:57:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:16,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 13:57:16,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2023-02-14 13:57:16,525 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:57:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:16,920 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2023-02-14 13:57:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 13:57:16,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2023-02-14 13:57:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:16,921 INFO L225 Difference]: With dead ends: 106 [2023-02-14 13:57:16,921 INFO L226 Difference]: Without dead ends: 106 [2023-02-14 13:57:16,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2023-02-14 13:57:16,922 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 138 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:16,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 530 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:57:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-14 13:57:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2023-02-14 13:57:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 76 states have internal predecessors, (83), 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-14 13:57:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-02-14 13:57:16,924 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 52 [2023-02-14 13:57:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:16,924 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-02-14 13:57:16,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:57:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-02-14 13:57:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 13:57:16,925 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:16,925 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:16,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:17,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:17,129 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:17,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash -521057353, now seen corresponding path program 1 times [2023-02-14 13:57:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:17,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539962064] [2023-02-14 13:57:17,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:17,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:17,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:17,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:57:17,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:17,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539962064] [2023-02-14 13:57:17,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539962064] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:17,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077176105] [2023-02-14 13:57:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:17,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:17,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:17,568 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:17,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 13:57:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:17,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-14 13:57:17,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:17,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:57:17,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:57:17,827 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1784 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1784))) is different from true [2023-02-14 13:57:17,835 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1784 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1784))) is different from true [2023-02-14 13:57:17,848 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:57:17,849 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-14 13:57:17,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:57:17,963 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:57:17,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:57:18,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-02-14 13:57:18,285 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1787 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1787))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1785 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1785))))) is different from true [2023-02-14 13:57:18,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:18,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-14 13:57:18,315 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 13:57:18,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-14 13:57:18,446 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:57:18,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 13:57:18,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 13:57:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2023-02-14 13:57:18,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:18,495 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1788) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-14 13:57:18,546 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) v_ArrVal_1788) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-14 13:57:18,598 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1795 Int) (|v_node_create_~temp~0#1.base_31| Int)) (or (not (= 0 (select |c_#valid| |v_node_create_~temp~0#1.base_31|))) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_31| v_ArrVal_1795) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_31| v_ArrVal_1794))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) v_ArrVal_1788)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_31| |c_#StackHeapBarrier|)))) is different from false [2023-02-14 13:57:18,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077176105] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:18,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:18,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 42 [2023-02-14 13:57:18,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003051742] [2023-02-14 13:57:18,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:18,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-14 13:57:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:18,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-14 13:57:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1491, Unknown=21, NotChecked=498, Total=2162 [2023-02-14 13:57:18,601 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 43 states, 40 states have (on average 2.15) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:57:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:19,340 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2023-02-14 13:57:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 13:57:19,341 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 2.15) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2023-02-14 13:57:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:19,342 INFO L225 Difference]: With dead ends: 156 [2023-02-14 13:57:19,342 INFO L226 Difference]: Without dead ends: 156 [2023-02-14 13:57:19,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=458, Invalid=2851, Unknown=21, NotChecked=702, Total=4032 [2023-02-14 13:57:19,343 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 949 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:19,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 686 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1032 Invalid, 3 Unknown, 341 Unchecked, 0.4s Time] [2023-02-14 13:57:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-14 13:57:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 87. [2023-02-14 13:57:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 82 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-14 13:57:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2023-02-14 13:57:19,345 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 52 [2023-02-14 13:57:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:19,346 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2023-02-14 13:57:19,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 2.15) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:57:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2023-02-14 13:57:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 13:57:19,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:19,346 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:19,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:19,552 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,SelfDestructingSolverStorable16 [2023-02-14 13:57:19,553 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash -521057352, now seen corresponding path program 1 times [2023-02-14 13:57:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:19,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368021199] [2023-02-14 13:57:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:19,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:57:20,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:20,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368021199] [2023-02-14 13:57:20,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368021199] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:20,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31248019] [2023-02-14 13:57:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:20,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:20,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:20,313 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:20,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 13:57:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:20,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 71 conjunts are in the unsatisfiable core [2023-02-14 13:57:20,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:20,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 13:57:20,768 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-14 13:57:20,847 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1965 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_1964 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1965)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1964)))) is different from true [2023-02-14 13:57:20,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:20,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-14 13:57:20,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:20,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:57:21,189 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:57:21,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 62 [2023-02-14 13:57:21,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:21,199 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 36 treesize of output 27 [2023-02-14 13:57:21,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 13:57:21,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2023-02-14 13:57:21,249 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-14 13:57:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-14 13:57:21,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:21,418 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_1966 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_1966)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1966 Int) (v_ArrVal_1968 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_1966)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-14 13:57:21,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:21,534 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 57 treesize of output 61 [2023-02-14 13:57:23,239 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int)) (or (not (= (select (select .cse0 .cse1) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4)) 0)) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1976) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (forall ((v_ArrVal_1968 (Array Int Int))) (= .cse1 (select (select (store .cse0 .cse1 v_ArrVal_1968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_prenex_6 Int) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1976)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4))) (or (not (= (select (select .cse2 .cse3) .cse4) 0)) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select .cse5 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (<= 0 (+ (select (select (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_prenex_6)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int) (v_ArrVal_1966 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1976)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse8 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4))) (or (not (= (select (select .cse6 .cse7) .cse8) 0)) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select .cse9 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (< (select (select (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 v_ArrVal_1966)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 1)))))) (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-02-14 13:57:23,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31248019] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:23,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:23,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2023-02-14 13:57:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59054431] [2023-02-14 13:57:23,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:23,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-14 13:57:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:23,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-14 13:57:23,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1747, Unknown=4, NotChecked=258, Total=2162 [2023-02-14 13:57:23,244 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 13:57:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:24,643 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2023-02-14 13:57:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 13:57:24,644 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2023-02-14 13:57:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:24,645 INFO L225 Difference]: With dead ends: 117 [2023-02-14 13:57:24,645 INFO L226 Difference]: Without dead ends: 117 [2023-02-14 13:57:24,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=452, Invalid=3216, Unknown=4, NotChecked=360, Total=4032 [2023-02-14 13:57:24,646 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 577 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:24,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 811 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 793 Invalid, 0 Unknown, 104 Unchecked, 0.4s Time] [2023-02-14 13:57:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-14 13:57:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2023-02-14 13:57:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.2465753424657535) 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-14 13:57:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2023-02-14 13:57:24,652 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 52 [2023-02-14 13:57:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:24,653 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2023-02-14 13:57:24,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 13:57:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2023-02-14 13:57:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 13:57:24,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:24,654 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:24,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:24,860 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,SelfDestructingSolverStorable17 [2023-02-14 13:57:24,860 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:24,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1804686442, now seen corresponding path program 1 times [2023-02-14 13:57:24,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:24,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287547234] [2023-02-14 13:57:24,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:25,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:25,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:25,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:57:25,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:25,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287547234] [2023-02-14 13:57:25,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287547234] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:25,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177628151] [2023-02-14 13:57:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:25,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:25,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:25,179 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:25,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 13:57:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:25,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 13:57:25,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:25,595 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-14 13:57:25,642 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2144 (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_2144)))) is different from true [2023-02-14 13:57:25,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:25,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-14 13:57:25,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 13:57:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2023-02-14 13:57:25,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:25,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177628151] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:25,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:25,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-14 13:57:25,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89063682] [2023-02-14 13:57:25,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:25,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 13:57:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 13:57:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=4, NotChecked=50, Total=756 [2023-02-14 13:57:25,797 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:57:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:26,228 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-14 13:57:26,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 13:57:26,229 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2023-02-14 13:57:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:26,229 INFO L225 Difference]: With dead ends: 80 [2023-02-14 13:57:26,229 INFO L226 Difference]: Without dead ends: 80 [2023-02-14 13:57:26,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=4, NotChecked=66, Total=1260 [2023-02-14 13:57:26,230 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 310 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:26,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 551 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 449 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2023-02-14 13:57:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-14 13:57:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-14 13:57:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.265625) internal successors, (81), 75 states have internal predecessors, (81), 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-14 13:57:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-02-14 13:57:26,238 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 53 [2023-02-14 13:57:26,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:26,238 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-02-14 13:57:26,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:57:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-02-14 13:57:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 13:57:26,241 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:26,241 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:26,248 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-14 13:57:26,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:26,448 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:26,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1947817869, now seen corresponding path program 2 times [2023-02-14 13:57:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:26,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614239982] [2023-02-14 13:57:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:26,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:27,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:57:28,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:28,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614239982] [2023-02-14 13:57:28,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614239982] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:28,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393608411] [2023-02-14 13:57:28,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:57:28,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:28,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:28,510 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:28,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 13:57:28,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 13:57:28,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:57:28,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 131 conjunts are in the unsatisfiable core [2023-02-14 13:57:28,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:28,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:57:28,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:57:28,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:57:29,295 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:57:29,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-14 13:57:29,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 13:57:29,314 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-14 13:57:29,314 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 19 treesize of output 16 [2023-02-14 13:57:29,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:57:29,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-14 13:57:29,461 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 28 [2023-02-14 13:57:29,768 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-14 13:57:29,769 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 84 [2023-02-14 13:57:29,779 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-14 13:57:29,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 29 [2023-02-14 13:57:29,784 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-14 13:57:29,885 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2319 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2320 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2319)) (= 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_2320)))) is different from true [2023-02-14 13:57:29,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:29,930 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-14 13:57:29,930 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 165 treesize of output 149 [2023-02-14 13:57:29,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:29,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:29,940 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2023-02-14 13:57:29,941 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 156 treesize of output 135 [2023-02-14 13:57:29,957 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-14 13:57:29,957 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 34 treesize of output 36 [2023-02-14 13:57:30,405 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-14 13:57:30,405 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 96 [2023-02-14 13:57:30,417 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-14 13:57:30,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 32 [2023-02-14 13:57:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-14 13:57:30,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:30,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393608411] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:30,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:30,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 52 [2023-02-14 13:57:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944151193] [2023-02-14 13:57:30,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:30,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-14 13:57:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-14 13:57:30,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3027, Unknown=2, NotChecked=110, Total=3306 [2023-02-14 13:57:30,937 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 52 states, 50 states have (on average 1.68) internal successors, (84), 46 states have internal predecessors, (84), 6 states have call successors, (6), 3 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-14 13:57:34,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:34,840 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2023-02-14 13:57:34,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 13:57:34,841 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.68) internal successors, (84), 46 states have internal predecessors, (84), 6 states have call successors, (6), 3 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 53 [2023-02-14 13:57:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:34,841 INFO L225 Difference]: With dead ends: 105 [2023-02-14 13:57:34,841 INFO L226 Difference]: Without dead ends: 105 [2023-02-14 13:57:34,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=428, Invalid=5274, Unknown=2, NotChecked=148, Total=5852 [2023-02-14 13:57:34,843 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 153 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:34,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1201 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1359 Invalid, 0 Unknown, 95 Unchecked, 1.0s Time] [2023-02-14 13:57:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-14 13:57:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2023-02-14 13:57:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 93 states have internal predecessors, (101), 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-14 13:57:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2023-02-14 13:57:34,845 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 53 [2023-02-14 13:57:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:34,845 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2023-02-14 13:57:34,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.68) internal successors, (84), 46 states have internal predecessors, (84), 6 states have call successors, (6), 3 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-14 13:57:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2023-02-14 13:57:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-14 13:57:34,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:34,846 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:34,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:35,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:35,050 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash 729745886, now seen corresponding path program 1 times [2023-02-14 13:57:35,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:35,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305174215] [2023-02-14 13:57:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:35,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:35,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:57:36,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:36,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305174215] [2023-02-14 13:57:36,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305174215] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:36,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788873267] [2023-02-14 13:57:36,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:36,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:36,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:36,244 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:36,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-14 13:57:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:36,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 105 conjunts are in the unsatisfiable core [2023-02-14 13:57:36,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:36,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:57:36,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:57:36,533 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2496 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2496)))) is different from true [2023-02-14 13:57:36,546 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2496 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2496))) (not (= |c_node_create_#res#1.base| 0))) is different from true [2023-02-14 13:57:36,571 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:57:36,571 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 13:57:36,745 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:57:36,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:57:36,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:57:36,893 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-14 13:57:36,893 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 3 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:57:37,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:57:37,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:37,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2023-02-14 13:57:37,292 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-14 13:57:37,297 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-14 13:57:37,516 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2500 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2500) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2504 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2504))) (exists ((v_ArrVal_2503 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2503) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 13:57:37,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:37,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:57:37,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:37,593 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:57:37,594 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 61 treesize of output 55 [2023-02-14 13:57:37,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:37,600 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 16 treesize of output 18 [2023-02-14 13:57:37,610 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:57:37,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-14 13:57:37,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:57:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2023-02-14 13:57:37,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:38,516 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2505 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (|v_node_create_~temp~0#1.base_43| Int) (v_ArrVal_2516 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_43| v_ArrVal_2515))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_43|) 0)) (< (select (store |c_#length| |v_node_create_~temp~0#1.base_43| v_ArrVal_2516) (select (select (store .cse0 .cse1 v_ArrVal_2505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 8) (not (< |v_node_create_~temp~0#1.base_43| |c_#StackHeapBarrier|)) (not (= (select (select .cse0 .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_43| v_ArrVal_2514) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)) 0)))))) is different from false [2023-02-14 13:57:38,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788873267] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:38,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:38,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 47 [2023-02-14 13:57:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127717178] [2023-02-14 13:57:38,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:38,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-14 13:57:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-14 13:57:38,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2622, Unknown=15, NotChecked=420, Total=3192 [2023-02-14 13:57:38,520 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 47 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:57:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:41,686 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2023-02-14 13:57:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 13:57:41,687 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2023-02-14 13:57:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:41,687 INFO L225 Difference]: With dead ends: 104 [2023-02-14 13:57:41,688 INFO L226 Difference]: Without dead ends: 104 [2023-02-14 13:57:41,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=462, Invalid=4939, Unknown=17, NotChecked=588, Total=6006 [2023-02-14 13:57:41,689 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 334 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:41,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 923 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1668 Invalid, 3 Unknown, 274 Unchecked, 0.9s Time] [2023-02-14 13:57:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-14 13:57:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2023-02-14 13:57:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 85 states have internal predecessors, (91), 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-14 13:57:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2023-02-14 13:57:41,691 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 56 [2023-02-14 13:57:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:41,691 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2023-02-14 13:57:41,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:57:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2023-02-14 13:57:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-14 13:57:41,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:41,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:41,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:41,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-14 13:57:41,892 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash 294390785, now seen corresponding path program 1 times [2023-02-14 13:57:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:41,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271825568] [2023-02-14 13:57:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:42,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:42,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:57:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:42,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271825568] [2023-02-14 13:57:42,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271825568] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:42,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913966079] [2023-02-14 13:57:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:42,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:42,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:42,587 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:42,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-14 13:57:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:42,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 87 conjunts are in the unsatisfiable core [2023-02-14 13:57:42,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:42,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:57:43,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:57:43,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:43,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 12 [2023-02-14 13:57:43,311 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-14 13:57:43,441 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2686 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2686))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2690 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2690) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2689 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2689))))) is different from true [2023-02-14 13:57:43,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:43,473 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:57:43,473 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 29 treesize of output 35 [2023-02-14 13:57:43,488 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 13:57:43,488 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 21 treesize of output 29 [2023-02-14 13:57:43,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:43,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:57:43,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:57:43,742 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-14 13:57:43,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 44 [2023-02-14 13:57:43,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-02-14 13:57:43,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:43,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2023-02-14 13:57:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-14 13:57:43,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:43,806 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2691 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2691) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-14 13:57:43,812 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2691 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2691) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-14 13:57:43,818 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2691 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) v_ArrVal_2691) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-14 13:57:44,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913966079] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:44,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:44,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2023-02-14 13:57:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453534634] [2023-02-14 13:57:44,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:44,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-14 13:57:44,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:44,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-14 13:57:44,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2534, Unknown=41, NotChecked=420, Total=3192 [2023-02-14 13:57:44,043 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 51 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 46 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:57:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:46,552 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2023-02-14 13:57:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-14 13:57:46,552 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 46 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2023-02-14 13:57:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:46,553 INFO L225 Difference]: With dead ends: 176 [2023-02-14 13:57:46,553 INFO L226 Difference]: Without dead ends: 176 [2023-02-14 13:57:46,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=889, Invalid=6055, Unknown=44, NotChecked=668, Total=7656 [2023-02-14 13:57:46,554 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1284 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:46,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 841 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1493 Invalid, 3 Unknown, 106 Unchecked, 0.7s Time] [2023-02-14 13:57:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-14 13:57:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 94. [2023-02-14 13:57:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.25) internal successors, (95), 87 states have internal predecessors, (95), 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-14 13:57:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2023-02-14 13:57:46,559 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 56 [2023-02-14 13:57:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:46,559 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2023-02-14 13:57:46,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 46 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:57:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2023-02-14 13:57:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-14 13:57:46,560 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:46,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:46,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-14 13:57:46,765 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-14 13:57:46,766 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:46,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash 294390786, now seen corresponding path program 1 times [2023-02-14 13:57:46,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:46,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483971128] [2023-02-14 13:57:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:47,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:47,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:57:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:48,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483971128] [2023-02-14 13:57:48,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483971128] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:48,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532309326] [2023-02-14 13:57:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:48,302 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:48,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-14 13:57:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:48,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 105 conjunts are in the unsatisfiable core [2023-02-14 13:57:48,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:48,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:57:48,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:57:48,630 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:57:48,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:57:48,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:57:49,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:49,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2023-02-14 13:57:49,102 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-14 13:57:49,226 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2874 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2874))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2875 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2875) |c_#memory_$Pointer$.offset|)))) is different from true [2023-02-14 13:57:49,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:49,258 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:57:49,258 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 36 treesize of output 40 [2023-02-14 13:57:49,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:49,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:57:49,270 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:57:49,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-14 13:57:49,723 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-02-14 13:57:49,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 105 [2023-02-14 13:57:49,736 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-14 13:57:49,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 75 [2023-02-14 13:57:49,747 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:57:49,751 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:57:49,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 23 [2023-02-14 13:57:49,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:49,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 31 [2023-02-14 13:57:49,817 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-14 13:57:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 13:57:49,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:50,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:50,628 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 121 treesize of output 125 [2023-02-14 13:57:51,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532309326] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:51,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:57:51,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 60 [2023-02-14 13:57:51,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747248127] [2023-02-14 13:57:51,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:57:51,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-02-14 13:57:51,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:57:51,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-02-14 13:57:51,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4828, Unknown=29, NotChecked=140, Total=5256 [2023-02-14 13:57:51,561 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 61 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 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-14 13:57:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:57:55,244 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2023-02-14 13:57:55,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-14 13:57:55,244 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 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 56 [2023-02-14 13:57:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:57:55,245 INFO L225 Difference]: With dead ends: 162 [2023-02-14 13:57:55,245 INFO L226 Difference]: Without dead ends: 162 [2023-02-14 13:57:55,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2608 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=977, Invalid=9709, Unknown=30, NotChecked=204, Total=10920 [2023-02-14 13:57:55,246 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1262 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 13:57:55,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 747 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1674 Invalid, 0 Unknown, 119 Unchecked, 0.8s Time] [2023-02-14 13:57:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-14 13:57:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96. [2023-02-14 13:57:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 89 states have internal predecessors, (95), 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-14 13:57:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2023-02-14 13:57:55,249 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 56 [2023-02-14 13:57:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:57:55,249 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2023-02-14 13:57:55,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 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-14 13:57:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2023-02-14 13:57:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-14 13:57:55,249 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:57:55,249 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:57:55,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-14 13:57:55,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:55,450 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:57:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:57:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash 348951848, now seen corresponding path program 1 times [2023-02-14 13:57:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:57:55,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194120835] [2023-02-14 13:57:55,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:57:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:57:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:57:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:57,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:57:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:57:57,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:57:57,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194120835] [2023-02-14 13:57:57,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194120835] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:57:57,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228331847] [2023-02-14 13:57:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:57:57,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:57:57,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:57:57,617 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:57:57,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-14 13:57:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:57:57,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-14 13:57:57,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:57:58,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:57:58,135 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-14 13:57:58,219 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:57:58,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 13:57:58,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:57:58,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:58,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:57:58,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:58,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2023-02-14 13:57:58,611 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-14 13:57:58,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-14 13:57:58,616 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-14 13:57:58,786 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3065 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3065))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3064 (Array Int Int))) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_3064) |c_#memory_int|)) (exists ((v_ArrVal_3063 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3063) |c_#memory_$Pointer$.base|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 13:57:58,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:58,828 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:57:58,828 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 77 treesize of output 65 [2023-02-14 13:57:58,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:58,837 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-14 13:57:58,852 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:57:58,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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-14 13:57:58,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:58,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:57:59,490 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-14 13:57:59,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 153 treesize of output 112 [2023-02-14 13:57:59,513 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-14 13:57:59,514 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 69 treesize of output 49 [2023-02-14 13:57:59,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:57:59,518 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 32 treesize of output 34 [2023-02-14 13:57:59,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:57:59,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 27 [2023-02-14 13:57:59,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:57:59,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:57:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 13:57:59,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:57:59,816 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3067 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3066) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3068) |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_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) v_ArrVal_3067)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-14 13:58:00,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228331847] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:00,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:58:00,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2023-02-14 13:58:00,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72274912] [2023-02-14 13:58:00,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:58:00,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-14 13:58:00,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:58:00,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-14 13:58:00,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=5295, Unknown=3, NotChecked=294, Total=5852 [2023-02-14 13:58:00,510 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 66 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 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-14 13:58:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:58:07,289 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2023-02-14 13:58:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-14 13:58:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 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 60 [2023-02-14 13:58:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:58:07,290 INFO L225 Difference]: With dead ends: 157 [2023-02-14 13:58:07,290 INFO L226 Difference]: Without dead ends: 157 [2023-02-14 13:58:07,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1115, Invalid=10662, Unknown=3, NotChecked=430, Total=12210 [2023-02-14 13:58:07,291 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1256 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:58:07,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1063 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2052 Invalid, 0 Unknown, 80 Unchecked, 1.1s Time] [2023-02-14 13:58:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-14 13:58:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2023-02-14 13:58:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 99 states have internal predecessors, (106), 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-14 13:58:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2023-02-14 13:58:07,294 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 60 [2023-02-14 13:58:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:58:07,294 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2023-02-14 13:58:07,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 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-14 13:58:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2023-02-14 13:58:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-14 13:58:07,295 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:58:07,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:58:07,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-14 13:58:07,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:58:07,500 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:58:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:58:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394117, now seen corresponding path program 1 times [2023-02-14 13:58:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:58:07,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036160058] [2023-02-14 13:58:07,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:58:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:08,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:58:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:58:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:09,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:58:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:58:09,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:58:09,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036160058] [2023-02-14 13:58:09,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036160058] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:09,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606053244] [2023-02-14 13:58:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:09,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:58:09,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:58:09,610 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:58:09,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-14 13:58:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:09,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 115 conjunts are in the unsatisfiable core [2023-02-14 13:58:09,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:58:09,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:58:09,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:58:09,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:58:09,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:58:10,080 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:58:10,081 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 13:58:10,092 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:58:10,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:58:10,381 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-14 13:58:10,582 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:58:10,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 13:58:10,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:10,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-14 13:58:10,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:58:11,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:58:11,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 33 [2023-02-14 13:58:11,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 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-14 13:58:11,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:58:11,098 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-14 13:58:11,314 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3255 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3255) |c_#length|)) (exists ((v_ArrVal_3260 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3260))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3259 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3259) |c_#memory_$Pointer$.offset|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-14 13:58:11,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:11,358 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:58:11,358 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 86 treesize of output 68 [2023-02-14 13:58:11,392 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-14 13:58:11,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2023-02-14 13:58:11,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:11,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:58:11,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:11,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:58:11,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:58:11,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-02-14 13:58:12,006 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2023-02-14 13:58:12,007 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 3 case distinctions, treesize of input 122 treesize of output 78 [2023-02-14 13:58:12,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:58:12,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:58:12,356 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:58:12,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:12,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:58:12,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 49 [2023-02-14 13:58:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-14 13:58:12,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:58:13,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606053244] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:13,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:58:13,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31] total 67 [2023-02-14 13:58:13,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26686807] [2023-02-14 13:58:13,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:58:13,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-02-14 13:58:13,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:58:13,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-02-14 13:58:13,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=5006, Unknown=2, NotChecked=142, Total=5402 [2023-02-14 13:58:13,554 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 68 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 6 states have call successors, (6), 3 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-14 13:58:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:58:24,820 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2023-02-14 13:58:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-14 13:58:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 6 states have call successors, (6), 3 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 61 [2023-02-14 13:58:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:58:24,821 INFO L225 Difference]: With dead ends: 170 [2023-02-14 13:58:24,821 INFO L226 Difference]: Without dead ends: 170 [2023-02-14 13:58:24,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2899 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=1480, Invalid=11402, Unknown=4, NotChecked=224, Total=13110 [2023-02-14 13:58:24,823 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1629 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 58 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:58:24,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 868 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2096 Invalid, 3 Unknown, 131 Unchecked, 1.5s Time] [2023-02-14 13:58:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-02-14 13:58:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2023-02-14 13:58:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 102 states have internal predecessors, (111), 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-14 13:58:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2023-02-14 13:58:24,827 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 61 [2023-02-14 13:58:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:58:24,827 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2023-02-14 13:58:24,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 6 states have call successors, (6), 3 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-14 13:58:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2023-02-14 13:58:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-14 13:58:24,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:58:24,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:58:24,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-14 13:58:25,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-14 13:58:25,039 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:58:25,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:58:25,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394116, now seen corresponding path program 1 times [2023-02-14 13:58:25,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:58:25,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790933806] [2023-02-14 13:58:25,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:25,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:58:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:26,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:58:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:58:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:58:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:58:27,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:58:27,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790933806] [2023-02-14 13:58:27,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790933806] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:27,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401986428] [2023-02-14 13:58:27,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:58:27,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:58:27,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:58:27,088 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:58:27,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-14 13:58:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:58:27,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-14 13:58:27,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:58:27,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-14 13:58:27,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:58:27,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:58:27,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:58:27,540 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:58:27,541 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 13:58:27,557 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:58:27,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 13:58:27,806 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:58:27,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-02-14 13:58:27,810 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-14 13:58:28,011 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-14 13:58:28,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-02-14 13:58:28,023 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:58:28,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2023-02-14 13:58:28,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:58:28,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:58:28,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:58:28,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 47 [2023-02-14 13:58:28,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:28,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-14 13:58:28,566 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:58:28,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-02-14 13:58:28,570 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:58:28,739 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3457 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3457))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3456 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3456))) (exists ((v_ArrVal_3453 Int)) (and (<= 8 v_ArrVal_3453) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3453) |c_#length|))))) is different from true [2023-02-14 13:58:28,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:28,798 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:58:28,798 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 110 treesize of output 84 [2023-02-14 13:58:28,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:28,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:28,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-14 13:58:28,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:28,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:28,817 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-14 13:58:28,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2023-02-14 13:58:28,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:28,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:28,831 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:58:28,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-14 13:58:29,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:29,404 INFO L321 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2023-02-14 13:58:29,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-02-14 13:58:29,433 INFO L321 Elim1Store]: treesize reduction 65, result has 30.1 percent of original size [2023-02-14 13:58:29,434 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 84 [2023-02-14 13:58:29,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:58:29,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:58:29,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:58:29,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 60 [2023-02-14 13:58:29,811 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:58:29,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2023-02-14 13:58:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-14 13:58:30,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:58:32,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401986428] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:58:32,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:58:32,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30] total 66 [2023-02-14 13:58:32,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685878002] [2023-02-14 13:58:32,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:58:32,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-02-14 13:58:32,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:58:32,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-02-14 13:58:32,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=5585, Unknown=8, NotChecked=150, Total=6006 [2023-02-14 13:58:32,048 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 67 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 3 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-14 13:59:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:59:10,400 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2023-02-14 13:59:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-14 13:59:10,400 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 3 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 61 [2023-02-14 13:59:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:59:10,401 INFO L225 Difference]: With dead ends: 174 [2023-02-14 13:59:10,401 INFO L226 Difference]: Without dead ends: 174 [2023-02-14 13:59:10,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2554 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=1381, Invalid=12184, Unknown=11, NotChecked=230, Total=13806 [2023-02-14 13:59:10,402 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1352 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 42 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:59:10,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 983 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2392 Invalid, 3 Unknown, 126 Unchecked, 2.3s Time] [2023-02-14 13:59:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-14 13:59:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 111. [2023-02-14 13:59:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 104 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-14 13:59:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2023-02-14 13:59:10,404 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 61 [2023-02-14 13:59:10,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:59:10,404 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2023-02-14 13:59:10,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 3 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-14 13:59:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2023-02-14 13:59:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-14 13:59:10,412 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:59:10,412 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:59:10,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-14 13:59:10,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-14 13:59:10,614 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:59:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:59:10,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1413927454, now seen corresponding path program 1 times [2023-02-14 13:59:10,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:59:10,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046290509] [2023-02-14 13:59:10,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:59:10,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:59:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:12,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:59:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:12,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:59:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:59:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:59:13,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:59:13,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046290509] [2023-02-14 13:59:13,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046290509] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:59:13,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846241101] [2023-02-14 13:59:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:59:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:59:13,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:59:13,619 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:59:13,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-14 13:59:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:13,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 173 conjunts are in the unsatisfiable core [2023-02-14 13:59:13,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:59:13,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:59:13,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:59:14,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:59:14,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:14,219 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-14 13:59:14,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:14,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:59:14,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:59:14,590 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-14 13:59:14,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:59:15,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:15,038 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 12 treesize of output 14 [2023-02-14 13:59:15,056 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:59:15,056 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 13:59:15,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:59:15,077 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:59:15,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 13:59:15,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:59:15,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 13:59:15,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:59:15,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:59:15,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 42 [2023-02-14 13:59:15,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:15,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:59:15,890 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-14 13:59:15,892 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-14 13:59:15,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 13:59:16,112 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3660 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3660) |c_#memory_$Pointer$.base|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3659 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3659) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3654 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3654) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3658 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_3658))))) is different from true [2023-02-14 13:59:16,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:16,178 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:59:16,179 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 101 treesize of output 81 [2023-02-14 13:59:16,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:16,191 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 22 treesize of output 24 [2023-02-14 13:59:16,208 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:59:16,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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-14 13:59:16,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:16,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:16,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-14 13:59:16,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:16,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:59:17,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:17,196 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 13 treesize of output 9 [2023-02-14 13:59:17,537 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-14 13:59:17,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 224 treesize of output 175 [2023-02-14 13:59:17,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:17,572 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2023-02-14 13:59:17,573 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 116 [2023-02-14 13:59:17,579 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:59:17,579 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 55 treesize of output 40 [2023-02-14 13:59:18,025 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:59:18,025 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:59:18,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:18,033 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2023-02-14 13:59:18,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 54 [2023-02-14 13:59:18,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:18,043 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:59:18,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2023-02-14 13:59:18,359 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:59:18,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:59:18,361 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 15 treesize of output 10 [2023-02-14 13:59:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 13:59:18,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:59:22,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846241101] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:59:22,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:59:22,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 77 [2023-02-14 13:59:22,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721173750] [2023-02-14 13:59:22,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:59:22,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-02-14 13:59:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:59:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-02-14 13:59:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=7875, Unknown=46, NotChecked=178, Total=8372 [2023-02-14 13:59:22,659 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 states have internal predecessors, (116), 6 states have call successors, (6), 3 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-14 13:59:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:59:39,549 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2023-02-14 13:59:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-14 13:59:39,550 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 states have internal predecessors, (116), 6 states have call successors, (6), 3 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 65 [2023-02-14 13:59:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:59:39,551 INFO L225 Difference]: With dead ends: 167 [2023-02-14 13:59:39,551 INFO L226 Difference]: Without dead ends: 167 [2023-02-14 13:59:39,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2008 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=1217, Invalid=14238, Unknown=49, NotChecked=246, Total=15750 [2023-02-14 13:59:39,552 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1355 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 65 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:59:39,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1418 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3732 Invalid, 5 Unknown, 115 Unchecked, 3.0s Time] [2023-02-14 13:59:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-14 13:59:39,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2023-02-14 13:59:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 109 states have internal predecessors, (117), 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-14 13:59:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2023-02-14 13:59:39,554 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 65 [2023-02-14 13:59:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:59:39,555 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2023-02-14 13:59:39,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 states have internal predecessors, (116), 6 states have call successors, (6), 3 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-14 13:59:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2023-02-14 13:59:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-14 13:59:39,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:59:39,555 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:59:39,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-14 13:59:39,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-14 13:59:39,756 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:59:39,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:59:39,756 INFO L85 PathProgramCache]: Analyzing trace with hash -655878667, now seen corresponding path program 3 times [2023-02-14 13:59:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:59:39,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916995002] [2023-02-14 13:59:39,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:59:39,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:59:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:39,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:59:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:39,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:59:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:39,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-14 13:59:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-14 13:59:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-02-14 13:59:39,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:59:39,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916995002] [2023-02-14 13:59:39,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916995002] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:59:39,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936562284] [2023-02-14 13:59:39,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 13:59:39,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:59:39,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:59:39,873 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:59:39,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-14 13:59:40,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-14 13:59:40,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:59:40,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 13:59:40,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:59:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-02-14 13:59:40,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:59:40,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936562284] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:59:40,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:59:40,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-14 13:59:40,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354874290] [2023-02-14 13:59:40,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:59:40,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:59:40,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:59:40,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:59:40,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:59:40,408 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:59:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:59:40,422 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-14 13:59:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:59:40,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 66 [2023-02-14 13:59:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:59:40,425 INFO L225 Difference]: With dead ends: 77 [2023-02-14 13:59:40,426 INFO L226 Difference]: Without dead ends: 77 [2023-02-14 13:59:40,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:59:40,426 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:59:40,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 81 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:59:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-14 13:59:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-14 13:59:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 72 states have internal predecessors, (75), 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-14 13:59:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-14 13:59:40,432 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 66 [2023-02-14 13:59:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:59:40,432 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-14 13:59:40,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:59:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-14 13:59:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-14 13:59:40,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:59:40,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:59:40,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-14 13:59:40,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:59:40,635 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 13:59:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:59:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash -882077631, now seen corresponding path program 2 times [2023-02-14 13:59:40,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:59:40,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186373353] [2023-02-14 13:59:40,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:59:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:59:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:59:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:42,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 13:59:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:42,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 13:59:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:59:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:59:43,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:59:43,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186373353] [2023-02-14 13:59:43,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186373353] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:59:43,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413803108] [2023-02-14 13:59:43,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:59:43,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:59:43,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:59:43,339 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:59:43,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-14 13:59:43,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 13:59:43,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:59:43,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 159 conjunts are in the unsatisfiable core [2023-02-14 13:59:43,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:59:43,668 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-14 13:59:43,732 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:59:43,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:59:43,913 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2023-02-14 13:59:43,913 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 3 case distinctions, treesize of input 22 treesize of output 29 [2023-02-14 13:59:44,131 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 13:59:44,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:59:44,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:59:44,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:44,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:59:44,336 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2023-02-14 13:59:44,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 41 [2023-02-14 13:59:44,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-02-14 13:59:44,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:59:44,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2023-02-14 13:59:44,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-14 13:59:44,812 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-14 13:59:44,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-02-14 13:59:45,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:45,223 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:59:45,223 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 55 [2023-02-14 13:59:45,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:45,249 INFO L321 Elim1Store]: treesize reduction 108, result has 28.5 percent of original size [2023-02-14 13:59:45,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 73 [2023-02-14 13:59:45,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:59:45,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:59:46,079 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:59:46,092 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-14 13:59:46,093 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 88 [2023-02-14 13:59:46,106 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-14 13:59:46,107 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 259 treesize of output 223 [2023-02-14 13:59:46,561 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 13:59:46,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 161 [2023-02-14 13:59:47,100 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-02-14 13:59:47,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 50 [2023-02-14 13:59:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:59:47,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:59:49,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413803108] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:59:49,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:59:49,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 37] total 80 [2023-02-14 13:59:49,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693570386] [2023-02-14 13:59:49,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:59:49,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-02-14 13:59:49,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:59:49,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-02-14 13:59:49,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=8818, Unknown=2, NotChecked=0, Total=9120 [2023-02-14 13:59:49,019 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 81 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 3 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-14 14:00:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:00:05,357 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2023-02-14 14:00:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-14 14:00:05,357 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 3 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 66 [2023-02-14 14:00:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:00:05,360 INFO L225 Difference]: With dead ends: 100 [2023-02-14 14:00:05,360 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 14:00:05,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3358 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=1389, Invalid=15900, Unknown=3, NotChecked=0, Total=17292 [2023-02-14 14:00:05,368 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1126 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 3159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-02-14 14:00:05,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1029 Invalid, 3159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3108 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2023-02-14 14:00:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 14:00:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2023-02-14 14:00:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2) internal successors, (78), 74 states have internal predecessors, (78), 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-14 14:00:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-02-14 14:00:05,372 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 66 [2023-02-14 14:00:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:00:05,372 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-02-14 14:00:05,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 3 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-14 14:00:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-02-14 14:00:05,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-14 14:00:05,373 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:00:05,373 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:00:05,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-14 14:00:05,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-14 14:00:05,580 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 14:00:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:00:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash -882077630, now seen corresponding path program 2 times [2023-02-14 14:00:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:00:05,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624898112] [2023-02-14 14:00:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:00:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:00:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:00:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 14:00:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:00:08,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 14:00:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:00:08,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 14:00:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:00:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 14:00:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:00:09,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624898112] [2023-02-14 14:00:09,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624898112] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:00:09,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867090655] [2023-02-14 14:00:09,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 14:00:09,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:00:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:00:09,185 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:00:09,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-14 14:00:09,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 14:00:09,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:00:09,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 204 conjunts are in the unsatisfiable core [2023-02-14 14:00:09,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:00:09,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 14:00:09,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 14:00:09,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 14:00:09,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 14:00:09,793 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 14:00:09,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 14:00:09,797 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-14 14:00:10,079 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-14 14:00:10,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 14:00:10,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 14:00:10,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:00:10,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 14:00:10,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:00:10,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 14:00:10,388 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 14:00:10,388 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 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 14:00:10,406 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 14:00:10,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 14:00:10,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-02-14 14:00:10,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-02-14 14:00:11,012 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 13 treesize of output 11 [2023-02-14 14:00:11,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:00:11,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 35 [2023-02-14 14:00:11,020 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-14 14:00:11,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:00:11,025 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 14:00:11,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:00:11,506 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 14:00:11,506 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 76 treesize of output 68 [2023-02-14 14:00:11,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:00:11,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 14:00:11,545 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 14:00:11,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-14 14:00:11,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:00:11,556 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 14:00:11,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2023-02-14 14:00:12,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:00:12,722 INFO L321 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2023-02-14 14:00:12,722 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 116 [2023-02-14 14:00:12,750 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2023-02-14 14:00:12,751 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 141 [2023-02-14 14:00:15,014 INFO L321 Elim1Store]: treesize reduction 184, result has 59.7 percent of original size [2023-02-14 14:00:15,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 379 treesize of output 457 [2023-02-14 14:00:15,439 INFO L321 Elim1Store]: treesize reduction 152, result has 60.1 percent of original size [2023-02-14 14:00:15,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 465 treesize of output 563 [2023-02-14 14:00:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 14:00:27,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:00:39,777 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 14:00:39,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867090655] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:00:39,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:00:39,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 82 [2023-02-14 14:00:39,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906269323] [2023-02-14 14:00:39,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:00:39,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2023-02-14 14:00:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:00:39,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2023-02-14 14:00:39,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=10391, Unknown=0, NotChecked=0, Total=10712 [2023-02-14 14:00:39,781 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 83 states, 80 states have (on average 1.4875) internal successors, (119), 74 states have internal predecessors, (119), 6 states have call successors, (6), 3 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-14 14:00:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:00:59,982 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2023-02-14 14:00:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-14 14:00:59,983 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 80 states have (on average 1.4875) internal successors, (119), 74 states have internal predecessors, (119), 6 states have call successors, (6), 3 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 66 [2023-02-14 14:00:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:00:59,983 INFO L225 Difference]: With dead ends: 96 [2023-02-14 14:00:59,983 INFO L226 Difference]: Without dead ends: 96 [2023-02-14 14:00:59,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4185 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=1282, Invalid=18740, Unknown=0, NotChecked=0, Total=20022 [2023-02-14 14:00:59,985 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 861 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-02-14 14:00:59,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1139 Invalid, 3512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-02-14 14:00:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-14 14:00:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2023-02-14 14:00:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 76 states have internal predecessors, (79), 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-14 14:00:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2023-02-14 14:00:59,987 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 66 [2023-02-14 14:00:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:00:59,987 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2023-02-14 14:00:59,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 80 states have (on average 1.4875) internal successors, (119), 74 states have internal predecessors, (119), 6 states have call successors, (6), 3 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-14 14:00:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2023-02-14 14:00:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-14 14:00:59,993 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:00:59,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:00,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-02-14 14:01:00,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:01:00,195 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-14 14:01:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash 642840936, now seen corresponding path program 2 times [2023-02-14 14:01:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:01:00,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926831889] [2023-02-14 14:01:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:00,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:01:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 14:01:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:02,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 14:01:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:02,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 14:01:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 14:01:03,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:01:03,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926831889] [2023-02-14 14:01:03,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926831889] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:01:03,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459492472] [2023-02-14 14:01:03,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 14:01:03,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:01:03,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:01:03,155 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:01:03,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-14 14:01:03,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 14:01:03,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:01:03,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 209 conjunts are in the unsatisfiable core [2023-02-14 14:01:03,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:01:03,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 14:01:03,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 14:01:03,690 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_create_#t~ret5#1.offset|) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)) is different from false [2023-02-14 14:01:03,691 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_create_#t~ret5#1.offset|) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)) is different from true [2023-02-14 14:01:03,711 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2023-02-14 14:01:03,713 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from true [2023-02-14 14:01:03,768 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0))))))) is different from false [2023-02-14 14:01:03,770 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_68| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |c_#valid|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |c_#valid| .cse0))))))) is different from true [2023-02-14 14:01:03,815 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))) is different from false [2023-02-14 14:01:03,817 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))) is different from true [2023-02-14 14:01:03,836 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2023-02-14 14:01:03,838 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2023-02-14 14:01:03,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 14:01:03,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 14:01:03,875 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_~temp~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse0) 0) (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse0) 0) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0))) is different from false [2023-02-14 14:01:03,877 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_~temp~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse0) 0) (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4451))) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse0) 0) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0))) is different from true [2023-02-14 14:01:03,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:01:03,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 14:01:03,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:01:03,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 14:01:03,922 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_#res#1.offset| 4))) (and (= |c_node_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) .cse0) 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_4451))) (not (= |c_node_create_#res#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) .cse0) 0))) is different from false [2023-02-14 14:01:03,923 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_#res#1.offset| 4))) (and (= |c_node_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) .cse0) 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4451 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_4451))) (not (= |c_node_create_#res#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) .cse0) 0))) is different from true [2023-02-14 14:01:03,988 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0)) is different from false [2023-02-14 14:01:03,991 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#t~ret5#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 4) 0)) is different from true [2023-02-14 14:01:04,041 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-02-14 14:01:04,044 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-02-14 14:01:04,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 14:01:04,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-14 14:01:04,085 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 14:01:04,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-14 14:01:04,121 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (<= .cse1 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse1) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_71| .cse3) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2023-02-14 14:01:04,135 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (<= .cse1 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse1) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_71| .cse3) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from true [2023-02-14 14:01:04,193 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| .cse1) 1)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= .cse4 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse4) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2023-02-14 14:01:04,196 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| .cse1) 1)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= .cse4 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse4) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2023-02-14 14:01:04,322 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse1) (<= .cse1 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| .cse3) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse3) 0)))))) is different from false [2023-02-14 14:01:04,325 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 .cse1) (<= .cse1 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| .cse3) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_70| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_71| .cse3) 0)))))) is different from true [2023-02-14 14:01:04,385 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_71| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_70| .cse4) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| .cse2 v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (not (= 0 .cse2))))) is different from false [2023-02-14 14:01:04,388 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_ArrVal_4451 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_71| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_70| .cse4) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_70| .cse2 v_ArrVal_4451)) (= (select |v_#valid_BEFORE_CALL_70| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_71| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (not (= 0 .cse2))))) is different from true [2023-02-14 14:01:04,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:01:04,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 37 [2023-02-14 14:01:04,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:01:04,415 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-14 14:01:04,438 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2023-02-14 14:01:04,441 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from true [2023-02-14 14:01:04,485 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2023-02-14 14:01:04,488 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2023-02-14 14:01:04,590 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_4465 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4465) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_4464 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4464) |c_#memory_$Pointer$.base|))) is different from false [2023-02-14 14:01:04,593 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_4465 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4465) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_4464 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4464) |c_#memory_$Pointer$.base|))) is different from true [2023-02-14 14:01:04,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 14:01:04,646 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4469))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4468))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2023-02-14 14:01:04,649 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4469))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4468))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2023-02-14 14:01:04,704 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4469))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_4468)))) is different from false [2023-02-14 14:01:04,707 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_4469 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4469))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse0 (select |v_#valid_BEFORE_CALL_69| .cse0)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (exists ((v_ArrVal_4468 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_4468)))) is different from true [2023-02-14 14:01:04,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:01:04,809 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 14:01:04,810 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 84 treesize of output 76 [2023-02-14 14:01:04,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:01:04,829 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-02-14 14:01:04,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2023-02-14 14:01:04,926 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse2 (select |v_#valid_BEFORE_CALL_69| .cse2)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse4 (select |v_#valid_BEFORE_CALL_75| .cse4))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse5) 0)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 .cse3)) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse3)))) is different from false [2023-02-14 14:01:04,931 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse2 (select |v_#valid_BEFORE_CALL_69| .cse2)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse4 (select |v_#valid_BEFORE_CALL_75| .cse4))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse5) 0)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 .cse3)) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse3)))) is different from true [2023-02-14 14:01:05,068 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse5 (select |v_#valid_BEFORE_CALL_70| .cse5)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from false [2023-02-14 14:01:05,073 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse5 (select |v_#valid_BEFORE_CALL_70| .cse5)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from true [2023-02-14 14:01:05,396 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| .cse5) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.base| .cse0) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from false [2023-02-14 14:01:05,400 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| .cse5) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem9#1.base| .cse0) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from true [2023-02-14 14:01:05,508 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse0) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse5) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from false [2023-02-14 14:01:05,512 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse6 (select |v_#valid_BEFORE_CALL_70| .cse6)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse0) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse5) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) is different from true [2023-02-14 14:01:05,839 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= (select .cse8 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2023-02-14 14:01:05,843 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= (select .cse8 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2023-02-14 14:01:06,010 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2023-02-14 14:01:06,014 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2023-02-14 14:01:06,195 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_sll_append_#t~mem11#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2023-02-14 14:01:06,200 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_sll_append_#t~mem11#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2023-02-14 14:01:06,398 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from false [2023-02-14 14:01:06,403 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse9 (+ .cse6 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse0))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse2 (select .cse3 4))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse2) 0)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse5 (select |v_#valid_BEFORE_CALL_69| .cse5)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse4 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse8 .cse9)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse10 (select .cse8 4))) (and (<= 0 .cse10) (<= .cse10 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) is different from true [2023-02-14 14:01:06,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:01:06,472 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 14:01:06,534 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2023-02-14 14:01:06,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 254 treesize of output 130 [2023-02-14 14:01:06,593 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2023-02-14 14:01:06,594 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 390 treesize of output 246 [2023-02-14 14:01:06,702 INFO L321 Elim1Store]: treesize reduction 63, result has 49.2 percent of original size [2023-02-14 14:01:06,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 80 [2023-02-14 14:01:06,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 14:01:06,790 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse6 (+ .cse0 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (+ 2 .cse1))) (and (or (and (<= 0 .cse0) (<= .cse0 0)) (= .cse1 .cse2)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0))) (not (= 0 .cse2)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_75| .cse2 1) .cse1) 0) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse5) 0))))))))) is different from false [2023-02-14 14:01:06,795 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse6 (+ .cse0 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (+ 2 .cse1))) (and (or (and (<= 0 .cse0) (<= .cse0 0)) (= .cse1 .cse2)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse4 (select |v_#valid_BEFORE_CALL_69| .cse4)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse7 (select |v_#valid_BEFORE_CALL_70| .cse7)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0))) (not (= 0 .cse2)) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_75| .cse2 1) .cse1) 0) (= (select |v_#valid_BEFORE_CALL_75| .cse2) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_75| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_74| .cse5) 0))))))))) is different from true [2023-02-14 14:01:07,505 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse9 (+ .cse1 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse6))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 |c_ULTIMATE.start_main_#t~mem13#1.offset|) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse7 (select |v_#valid_BEFORE_CALL_69| .cse7)))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-02-14 14:01:07,509 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse9 (+ .cse1 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse6))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 |c_ULTIMATE.start_main_#t~mem13#1.offset|) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse7 (select |v_#valid_BEFORE_CALL_69| .cse7)))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-02-14 14:01:07,762 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (+ .cse2 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ 2 .cse6))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse2) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (not (= .cse0 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse2 0) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse7 (select |v_#valid_BEFORE_CALL_69| .cse7)))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-02-14 14:01:07,766 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (+ .cse2 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ 2 .cse6))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |v_#valid_BEFORE_CALL_70| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse1 (select |v_#valid_BEFORE_CALL_70| .cse1)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse2) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse0) 0) (not (= .cse0 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse3 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse2 0) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse7 (select |v_#valid_BEFORE_CALL_69| .cse7)))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse8 (select |v_#valid_BEFORE_CALL_75| .cse8))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse0 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-02-14 14:01:08,290 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse10 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select .cse6 .cse7) |c_ULTIMATE.start_main_#t~mem14#1.base|) (<= .cse1 0) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= |c_ULTIMATE.start_main_#t~mem14#1.offset| (select .cse10 .cse7)) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-02-14 14:01:08,294 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse10 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select .cse6 .cse7) |c_ULTIMATE.start_main_#t~mem14#1.base|) (<= .cse1 0) (= .cse5 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= |c_ULTIMATE.start_main_#t~mem14#1.offset| (select .cse10 .cse7)) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-02-14 14:01:08,616 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse6 4)) (.cse11 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse11 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse6 .cse7)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select .cse11 .cse7) |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))))) is different from false [2023-02-14 14:01:08,620 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse6 4)) (.cse11 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse11 4)) (.cse12 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_75| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse5 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse6 .cse7)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select .cse11 .cse7) |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))))) is different from true [2023-02-14 14:01:08,959 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse7 4)) (.cse12 (+ .cse1 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse6) .cse12)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (+ .cse8 4)) (.cse2 (+ 2 .cse9))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= (select .cse7 .cse5) |c_ULTIMATE.start_main_~temp~2#1.base|) (= .cse8 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse10 (select |v_#valid_BEFORE_CALL_69| .cse10)))) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))))) is different from false [2023-02-14 14:01:08,964 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse7 4)) (.cse12 (+ .cse1 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse6) .cse12)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (+ .cse8 4)) (.cse2 (+ 2 .cse9))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= (select .cse7 .cse5) |c_ULTIMATE.start_main_~temp~2#1.base|) (= .cse8 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse10 (select |v_#valid_BEFORE_CALL_69| .cse10)))) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse11 (select |v_#valid_BEFORE_CALL_75| .cse11))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse12) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1)))))))))) is different from true [2023-02-14 14:01:09,193 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse12 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse4 4)) (.cse11 (+ .cse1 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) .cse11))) (let ((.cse2 (+ 2 .cse8)) (.cse5 (+ .cse7 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse7 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-02-14 14:01:09,197 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse12 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse4 4)) (.cse11 (+ .cse1 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) .cse11))) (let ((.cse2 (+ 2 .cse8)) (.cse5 (+ .cse7 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse7 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-02-14 14:01:09,371 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse12 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse4 4)) (.cse11 (+ .cse1 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) .cse11))) (let ((.cse2 (+ 2 .cse8)) (.cse5 (+ .cse7 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse7 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)))) is different from false [2023-02-14 14:01:09,375 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int)) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_71| (Array Int Int)) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (v_arrayElimIndex_85 Int) (|v_#valid_BEFORE_CALL_74| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse3))) (let ((.cse1 (select .cse12 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse6 (select .cse4 4)) (.cse11 (+ .cse1 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) .cse11))) (let ((.cse2 (+ 2 .cse8)) (.cse5 (+ .cse7 4))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse0 (select |v_#valid_BEFORE_CALL_70| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_75| .cse3) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 .cse5)) (= (select |v_#valid_BEFORE_CALL_75| .cse6) 1) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse2 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (<= .cse1 0) (= .cse7 0) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse9 (select |v_#valid_BEFORE_CALL_69| .cse9)))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse10 (select |v_#valid_BEFORE_CALL_75| .cse10))) |v_#valid_BEFORE_CALL_75|) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (not (= v_arrayElimIndex_85 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_75| .cse3 1) .cse8) 0) (= (select |v_#valid_BEFORE_CALL_74| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1) (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)))) is different from true [2023-02-14 14:01:09,413 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 14:01:09,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:01:09,435 INFO L321 Elim1Store]: treesize reduction 95, result has 6.9 percent of original size [2023-02-14 14:01:09,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 321 treesize of output 135 [2023-02-14 14:01:09,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:01:09,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:01:09,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 14:01:09,464 INFO L321 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2023-02-14 14:01:09,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 35 [2023-02-14 14:01:09,564 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem14#1.base|))) (and (= |c_ULTIMATE.start_main_#t~mem14#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_#t~mem14#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem14#1.base|) 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from false [2023-02-14 14:01:09,568 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem14#1.base|))) (and (= |c_ULTIMATE.start_main_#t~mem14#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_#t~mem14#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem14#1.base|) 0)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from true [2023-02-14 14:01:09,674 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2023-02-14 14:01:09,677 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2023-02-14 14:01:09,782 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2023-02-14 14:01:09,785 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) |v_#valid_BEFORE_CALL_75|) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse2 (select |v_#valid_BEFORE_CALL_70| .cse2)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (= |v_#valid_BEFORE_CALL_69| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse3 (select |v_#valid_BEFORE_CALL_69| .cse3)))) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2023-02-14 14:01:09,875 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse2 (select |v_#valid_BEFORE_CALL_75| .cse2))) |v_#valid_BEFORE_CALL_75|) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))))) is different from false [2023-02-14 14:01:09,878 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_69| (Array Int Int)) (|v_#valid_BEFORE_CALL_68| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|)) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) (= |v_#valid_BEFORE_CALL_69| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_68| |v_#valid_BEFORE_CALL_69|))) (store |v_#valid_BEFORE_CALL_68| .cse1 (select |v_#valid_BEFORE_CALL_69| .cse1)))) (= (select |v_#valid_BEFORE_CALL_68| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_52|) 1) (= (select |v_#valid_BEFORE_CALL_69| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_74| (Array Int Int)) (v_arrayElimIndex_94 Int) (|v_#valid_BEFORE_CALL_75| (Array Int Int)) (v_arrayElimIndex_93 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= v_arrayElimIndex_93 0)) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_94) 1) (= (select |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93) 0) (= (select (store |v_#valid_BEFORE_CALL_75| v_arrayElimIndex_93 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_74| v_arrayElimIndex_94) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_74| |v_#valid_BEFORE_CALL_75|))) (store |v_#valid_BEFORE_CALL_74| .cse2 (select |v_#valid_BEFORE_CALL_75| .cse2))) |v_#valid_BEFORE_CALL_75|) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= v_arrayElimIndex_94 0)) (= (select |v_#valid_BEFORE_CALL_74| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_71| (Array Int Int)) (v_arrayElimIndex_85 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| Int) (v_arrayElimCell_414 Int) (|v_#valid_BEFORE_CALL_70| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_70| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_71| |v_#valid_BEFORE_CALL_70|))) (store |v_#valid_BEFORE_CALL_71| .cse3 (select |v_#valid_BEFORE_CALL_70| .cse3)))) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimIndex_85) 0) (= 1 (select |v_#valid_BEFORE_CALL_71| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|)) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) (= (select |v_#valid_BEFORE_CALL_70| v_arrayElimCell_414) 1) (= (select |v_#valid_BEFORE_CALL_71| v_arrayElimCell_414) 0) (not (= v_arrayElimIndex_85 0)))))) is different from true [2023-02-14 14:01:10,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 14:01:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 46 not checked. [2023-02-14 14:01:10,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:01:12,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:01:12,261 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 1299 treesize of output 1300 [2023-02-14 14:01:12,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:01:12,287 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 3221 treesize of output 3224 [2023-02-14 14:01:12,318 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 1290 treesize of output 659