./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 01:08:36,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:08:36,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:08:36,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:08:36,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:08:36,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:08:36,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:08:36,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:08:36,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:08:36,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:08:36,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:08:36,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:08:36,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:08:36,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:08:36,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:08:36,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:08:36,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:08:36,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:08:36,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:08:36,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:08:36,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:08:36,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:08:36,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:08:36,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:08:36,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:08:36,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:08:36,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:08:36,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:08:36,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:08:36,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:08:36,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:08:36,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:08:36,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:08:36,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:08:36,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:08:36,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:08:36,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:08:36,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:08:36,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:08:36,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:08:36,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:08:36,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 01:08:36,708 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:08:36,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:08:36,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:08:36,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:08:36,711 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:08:36,711 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:08:36,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:08:36,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:08:36,712 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:08:36,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:08:36,712 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:08:36,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 01:08:36,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:08:36,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:08:36,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:08:36,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:08:36,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:08:36,714 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:08:36,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:08:36,714 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:08:36,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:08:36,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:08:36,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:08:36,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:08:36,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:08:36,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:08:36,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:08:36,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:08:36,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 01:08:36,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 01:08:36,716 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:08:36,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:08:36,716 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:08:36,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:08:36,716 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:08:36,716 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 ! call(reach_error())) ) 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-16 01:08:36,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:08:36,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:08:36,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:08:36,959 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:08:36,959 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:08:36,960 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-16 01:08:38,044 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:08:38,319 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:08:38,320 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-16 01:08:38,326 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb7ae62e/bc27bdc720ac4ed08301d93c0346785c/FLAGabf25c841 [2023-02-16 01:08:38,335 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb7ae62e/bc27bdc720ac4ed08301d93c0346785c [2023-02-16 01:08:38,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:08:38,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:08:38,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:08:38,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:08:38,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:08:38,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b588ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38, skipping insertion in model container [2023-02-16 01:08:38,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:08:38,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:08:38,596 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-16 01:08:38,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:08:38,609 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:08:38,644 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-16 01:08:38,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:08:38,664 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:08:38,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38 WrapperNode [2023-02-16 01:08:38,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:08:38,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:08:38,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:08:38,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:08:38,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,696 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2023-02-16 01:08:38,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:08:38,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:08:38,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:08:38,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:08:38,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,716 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:08:38,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:08:38,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:08:38,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:08:38,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (1/1) ... [2023-02-16 01:08:38,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:08:38,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:38,741 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-16 01:08:38,753 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-16 01:08:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 01:08:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 01:08:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-16 01:08:38,768 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-16 01:08:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 01:08:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:08:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 01:08:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 01:08:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 01:08:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 01:08:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 01:08:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 01:08:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:08:38,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:08:38,855 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:08:38,856 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:08:38,996 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:08:39,004 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:08:39,005 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 01:08:39,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:08:39 BoogieIcfgContainer [2023-02-16 01:08:39,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:08:39,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:08:39,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:08:39,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:08:39,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:08:38" (1/3) ... [2023-02-16 01:08:39,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e273a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:08:39, skipping insertion in model container [2023-02-16 01:08:39,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:38" (2/3) ... [2023-02-16 01:08:39,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e273a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:08:39, skipping insertion in model container [2023-02-16 01:08:39,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:08:39" (3/3) ... [2023-02-16 01:08:39,012 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-02-16 01:08:39,026 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:08:39,027 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:08:39,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:08:39,088 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2fd216d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:08:39,089 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:08:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 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-16 01:08:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 01:08:39,099 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:39,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:39,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2128592868, now seen corresponding path program 1 times [2023-02-16 01:08:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:39,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625975576] [2023-02-16 01:08:39,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:39,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:39,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 01:08:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:39,369 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-16 01:08:39,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:39,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625975576] [2023-02-16 01:08:39,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625975576] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:08:39,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:08:39,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 01:08:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506165761] [2023-02-16 01:08:39,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:08:39,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 01:08:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:39,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 01:08:39,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:08:39,421 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 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, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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-16 01:08:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:39,507 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2023-02-16 01:08:39,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 01:08:39,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 17 [2023-02-16 01:08:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:39,515 INFO L225 Difference]: With dead ends: 56 [2023-02-16 01:08:39,516 INFO L226 Difference]: Without dead ends: 25 [2023-02-16 01:08:39,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 01:08:39,520 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:39,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:08:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-16 01:08:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-16 01:08:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-16 01:08:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-16 01:08:39,545 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2023-02-16 01:08:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:39,546 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-16 01:08:39,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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-16 01:08:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-16 01:08:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 01:08:39,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:39,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:39,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 01:08:39,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:39,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1341887012, now seen corresponding path program 1 times [2023-02-16 01:08:39,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:39,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946096970] [2023-02-16 01:08:39,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:39,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 01:08:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:39,664 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-16 01:08:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:39,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946096970] [2023-02-16 01:08:39,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946096970] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:08:39,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:08:39,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:08:39,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544164758] [2023-02-16 01:08:39,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:08:39,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:08:39,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:39,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:08:39,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:08:39,668 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-16 01:08:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:39,697 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2023-02-16 01:08:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:08:39,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2023-02-16 01:08:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:39,699 INFO L225 Difference]: With dead ends: 48 [2023-02-16 01:08:39,699 INFO L226 Difference]: Without dead ends: 29 [2023-02-16 01:08:39,699 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-16 01:08:39,700 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:39,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:08:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-16 01:08:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-02-16 01:08:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-16 01:08:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-02-16 01:08:39,706 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2023-02-16 01:08:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:39,706 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-02-16 01:08:39,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-16 01:08:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-02-16 01:08:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 01:08:39,707 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:39,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:39,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 01:08:39,707 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2097266908, now seen corresponding path program 1 times [2023-02-16 01:08:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:39,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260489768] [2023-02-16 01:08:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:08:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:39,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-16 01:08:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:08:39,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:39,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260489768] [2023-02-16 01:08:39,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260489768] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:39,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293089449] [2023-02-16 01:08:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:39,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:39,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:39,830 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-16 01:08:39,831 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-16 01:08:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:39,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 01:08:39,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:08:39,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:08:39,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293089449] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:08:39,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:08:39,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-16 01:08:39,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182969635] [2023-02-16 01:08:39,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:39,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 01:08:39,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:39,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 01:08:39,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-16 01:08:39,997 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-16 01:08:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:40,028 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2023-02-16 01:08:40,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 01:08:40,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 26 [2023-02-16 01:08:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:40,030 INFO L225 Difference]: With dead ends: 49 [2023-02-16 01:08:40,030 INFO L226 Difference]: Without dead ends: 30 [2023-02-16 01:08:40,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 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-16 01:08:40,031 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:40,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 88 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:08:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-16 01:08:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-16 01:08:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-16 01:08:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-16 01:08:40,035 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2023-02-16 01:08:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:40,036 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-16 01:08:40,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-16 01:08:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-16 01:08:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 01:08:40,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:40,037 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:40,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 01:08:40,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:40,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash -867054116, now seen corresponding path program 2 times [2023-02-16 01:08:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:40,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371878570] [2023-02-16 01:08:40,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:40,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:40,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:08:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:40,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:08:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:40,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:08:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 01:08:40,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:40,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371878570] [2023-02-16 01:08:40,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371878570] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:08:40,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:08:40,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 01:08:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653396072] [2023-02-16 01:08:40,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:08:40,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 01:08:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 01:08:40,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-16 01:08:40,613 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-16 01:08:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:40,705 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-02-16 01:08:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 01:08:40,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 35 [2023-02-16 01:08:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:40,708 INFO L225 Difference]: With dead ends: 43 [2023-02-16 01:08:40,709 INFO L226 Difference]: Without dead ends: 40 [2023-02-16 01:08:40,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-02-16 01:08:40,714 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:40,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 133 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:08:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-16 01:08:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2023-02-16 01:08:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-16 01:08:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-02-16 01:08:40,726 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 35 [2023-02-16 01:08:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:40,727 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-02-16 01:08:40,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-16 01:08:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-02-16 01:08:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 01:08:40,728 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:40,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:40,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 01:08:40,731 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:40,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:40,731 INFO L85 PathProgramCache]: Analyzing trace with hash -867052442, now seen corresponding path program 1 times [2023-02-16 01:08:40,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:40,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097264542] [2023-02-16 01:08:40,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:40,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:41,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:08:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:41,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:08:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:41,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:08:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:08:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097264542] [2023-02-16 01:08:41,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097264542] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050614467] [2023-02-16 01:08:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:41,162 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-16 01:08:41,165 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-16 01:08:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:41,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-16 01:08:41,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:41,453 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-16 01:08:41,493 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_405 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_405))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-16 01:08:41,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:41,530 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-16 01:08:41,555 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-16 01:08:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-02-16 01:08:41,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:41,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050614467] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:41,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:41,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-02-16 01:08:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703784792] [2023-02-16 01:08:41,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:41,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 01:08:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 01:08:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=475, Unknown=6, NotChecked=44, Total=600 [2023-02-16 01:08:41,685 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 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-16 01:08:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:42,000 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-02-16 01:08:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 01:08:42,001 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 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 35 [2023-02-16 01:08:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:42,002 INFO L225 Difference]: With dead ends: 37 [2023-02-16 01:08:42,003 INFO L226 Difference]: Without dead ends: 30 [2023-02-16 01:08:42,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=733, Unknown=6, NotChecked=56, Total=930 [2023-02-16 01:08:42,003 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 66 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:42,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 149 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2023-02-16 01:08:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-16 01:08:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-16 01:08:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-16 01:08:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-02-16 01:08:42,012 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 35 [2023-02-16 01:08:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:42,013 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-02-16 01:08:42,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 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-16 01:08:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-02-16 01:08:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 01:08:42,015 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:42,015 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:42,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 01:08:42,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:42,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:42,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:42,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1386356248, now seen corresponding path program 1 times [2023-02-16 01:08:42,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:42,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919237197] [2023-02-16 01:08:42,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:42,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:42,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:08:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:42,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:08:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:08:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:08:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:42,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919237197] [2023-02-16 01:08:42,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919237197] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:42,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206630381] [2023-02-16 01:08:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:42,804 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-16 01:08:42,814 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-16 01:08:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:42,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 01:08:42,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:43,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-16 01:08:43,084 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_557 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_557))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 01:08:43,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:43,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-16 01:08:43,159 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-02-16 01:08:43,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 35 [2023-02-16 01:08:43,165 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-16 01:08:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-02-16 01:08:43,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:49,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206630381] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:49,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:49,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2023-02-16 01:08:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898313291] [2023-02-16 01:08:49,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:49,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-16 01:08:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-16 01:08:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=830, Unknown=10, NotChecked=58, Total=992 [2023-02-16 01:08:49,426 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 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-16 01:08:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:50,049 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-02-16 01:08:50,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 01:08:50,049 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 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 38 [2023-02-16 01:08:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:50,050 INFO L225 Difference]: With dead ends: 50 [2023-02-16 01:08:50,050 INFO L226 Difference]: Without dead ends: 47 [2023-02-16 01:08:50,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=308, Invalid=1756, Unknown=10, NotChecked=88, Total=2162 [2023-02-16 01:08:50,051 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 260 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:50,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 194 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 324 Invalid, 0 Unknown, 48 Unchecked, 0.2s Time] [2023-02-16 01:08:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-16 01:08:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2023-02-16 01:08:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-16 01:08:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-02-16 01:08:50,056 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 38 [2023-02-16 01:08:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:50,056 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-02-16 01:08:50,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 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-16 01:08:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-02-16 01:08:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 01:08:50,057 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:50,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:50,077 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-16 01:08:50,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:50,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:50,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1386357922, now seen corresponding path program 1 times [2023-02-16 01:08:50,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:50,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172651846] [2023-02-16 01:08:50,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:50,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:08:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:50,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:08:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:50,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:08:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:08:51,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:51,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172651846] [2023-02-16 01:08:51,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172651846] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:51,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599762994] [2023-02-16 01:08:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:51,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:51,171 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-16 01:08:51,187 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-16 01:08:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:51,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-16 01:08:51,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:51,462 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-16 01:08:51,586 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-16 01:08:51,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:51,740 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 22 treesize of output 13 [2023-02-16 01:08:51,745 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-16 01:08:51,860 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_714 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_714))) (exists ((v_ArrVal_715 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_715))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 01:08:51,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:51,904 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:08:51,904 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 28 treesize of output 34 [2023-02-16 01:08:51,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:51,911 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-16 01:08:51,919 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 01:08:51,919 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-16 01:08:51,994 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-16 01:08:52,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:52,034 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 24 treesize of output 11 [2023-02-16 01:08:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-02-16 01:08:52,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:52,184 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_720 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_node_create_~temp~0#1.base_19|))) (not (= 0 (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_721))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_19| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (not (< |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)))) is different from false [2023-02-16 01:08:52,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599762994] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:52,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:52,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2023-02-16 01:08:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473657470] [2023-02-16 01:08:52,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:52,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-16 01:08:52,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-16 01:08:52,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1105, Unknown=2, NotChecked=134, Total=1332 [2023-02-16 01:08:52,187 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 34 states, 32 states have (on average 1.90625) internal successors, (61), 29 states have internal predecessors, (61), 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-16 01:08:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:53,231 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-02-16 01:08:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 01:08:53,232 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.90625) internal successors, (61), 29 states have internal predecessors, (61), 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 38 [2023-02-16 01:08:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:53,233 INFO L225 Difference]: With dead ends: 42 [2023-02-16 01:08:53,234 INFO L226 Difference]: Without dead ends: 34 [2023-02-16 01:08:53,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=2031, Unknown=2, NotChecked=186, Total=2450 [2023-02-16 01:08:53,235 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 67 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:53,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 292 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 599 Invalid, 0 Unknown, 35 Unchecked, 0.3s Time] [2023-02-16 01:08:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-16 01:08:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-02-16 01:08:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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-16 01:08:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-02-16 01:08:53,243 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 38 [2023-02-16 01:08:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:53,243 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-02-16 01:08:53,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.90625) internal successors, (61), 29 states have internal predecessors, (61), 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-16 01:08:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-02-16 01:08:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 01:08:53,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:53,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:53,263 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-16 01:08:53,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:53,453 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:53,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash 403581565, now seen corresponding path program 1 times [2023-02-16 01:08:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:53,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48543990] [2023-02-16 01:08:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:54,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:08:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:54,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:08:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:54,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:08:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:08:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:54,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48543990] [2023-02-16 01:08:54,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48543990] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:54,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695531797] [2023-02-16 01:08:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:54,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:54,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:54,927 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-16 01:08:54,945 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-16 01:08:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:55,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 113 conjunts are in the unsatisfiable core [2023-02-16 01:08:55,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:55,189 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-16 01:08:55,344 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-16 01:08:55,404 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-16 01:08:55,461 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:08:55,461 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-16 01:08:55,520 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-16 01:08:55,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:55,532 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-16 01:08:55,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:55,755 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 61 treesize of output 28 [2023-02-16 01:08:55,758 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-16 01:08:55,764 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-16 01:08:55,834 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_880 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_880))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_878 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_878))) (exists ((v_ArrVal_879 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_879))))) is different from true [2023-02-16 01:08:55,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:55,861 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:08:55,861 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 69 treesize of output 59 [2023-02-16 01:08:55,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:55,868 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-16 01:08:55,882 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:08:55,882 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-16 01:08:55,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:55,890 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-16 01:08:56,117 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 01:08:56,118 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 101 treesize of output 84 [2023-02-16 01:08:56,127 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:08:56,127 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 48 treesize of output 49 [2023-02-16 01:08:56,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:56,132 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 32 treesize of output 34 [2023-02-16 01:08:56,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:56,186 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 48 treesize of output 23 [2023-02-16 01:08:56,190 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-16 01:08:56,223 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-16 01:08:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-16 01:08:56,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:56,272 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_882) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_883) |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| v_ArrVal_884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:08:56,283 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (let ((.cse0 (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)))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_882) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:08:56,292 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (let ((.cse0 (select (select |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|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_882) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:08:56,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695531797] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:56,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:56,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 46 [2023-02-16 01:08:56,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507530487] [2023-02-16 01:08:56,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:56,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-16 01:08:56,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:56,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-16 01:08:56,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1937, Unknown=4, NotChecked=364, Total=2450 [2023-02-16 01:08:56,458 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 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-16 01:08:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:58,710 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-02-16 01:08:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 01:08:58,711 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 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 40 [2023-02-16 01:08:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:58,712 INFO L225 Difference]: With dead ends: 48 [2023-02-16 01:08:58,712 INFO L226 Difference]: Without dead ends: 46 [2023-02-16 01:08:58,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=450, Invalid=3594, Unknown=4, NotChecked=508, Total=4556 [2023-02-16 01:08:58,714 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 247 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:58,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 322 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 741 Invalid, 0 Unknown, 47 Unchecked, 0.5s Time] [2023-02-16 01:08:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-16 01:08:58,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-02-16 01:08:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-16 01:08:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-02-16 01:08:58,725 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 40 [2023-02-16 01:08:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:58,726 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-02-16 01:08:58,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 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-16 01:08:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-02-16 01:08:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 01:08:58,726 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:58,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:58,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-16 01:08:58,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:58,935 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:58,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1294860110, now seen corresponding path program 1 times [2023-02-16 01:08:58,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:58,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522742002] [2023-02-16 01:08:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:58,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:59,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:08:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:00,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:09:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:00,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:09:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:09:00,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:09:00,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522742002] [2023-02-16 01:09:00,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522742002] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:00,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567102843] [2023-02-16 01:09:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:09:00,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:00,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:09:00,305 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-16 01:09:00,307 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-16 01:09:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:00,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 87 conjunts are in the unsatisfiable core [2023-02-16 01:09:00,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:09:00,431 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-16 01:09:00,440 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-16 01:09:00,526 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:09:00,526 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 14 [2023-02-16 01:09:00,585 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:09:00,585 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-16 01:09:00,681 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-16 01:09:00,682 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-16 01:09:00,748 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-16 01:09:00,935 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:09:00,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2023-02-16 01:09:00,940 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-16 01:09:00,945 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:09:00,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 10 [2023-02-16 01:09:00,999 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1049 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1049))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_1048 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1048))) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0))) is different from true [2023-02-16 01:09:01,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:01,013 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-16 01:09:01,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:01,023 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:09:01,024 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 73 treesize of output 61 [2023-02-16 01:09:01,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:01,038 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-02-16 01:09:01,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2023-02-16 01:09:01,254 INFO L321 Elim1Store]: treesize reduction 70, result has 33.3 percent of original size [2023-02-16 01:09:01,255 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 66 [2023-02-16 01:09:01,266 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-16 01:09:01,267 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 21 treesize of output 20 [2023-02-16 01:09:01,317 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-16 01:09:01,384 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:09:01,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 23 [2023-02-16 01:09:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-02-16 01:09:01,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:09:01,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567102843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:01,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:09:01,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 44 [2023-02-16 01:09:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594308240] [2023-02-16 01:09:01,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:09:01,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-16 01:09:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:09:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-16 01:09:01,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2109, Unknown=1, NotChecked=92, Total=2352 [2023-02-16 01:09:01,810 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 36 states have internal predecessors, (64), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 01:09:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:09:05,148 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2023-02-16 01:09:05,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-16 01:09:05,148 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 36 states have internal predecessors, (64), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2023-02-16 01:09:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:09:05,150 INFO L225 Difference]: With dead ends: 60 [2023-02-16 01:09:05,151 INFO L226 Difference]: Without dead ends: 57 [2023-02-16 01:09:05,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=679, Invalid=4580, Unknown=1, NotChecked=142, Total=5402 [2023-02-16 01:09:05,153 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 426 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 01:09:05,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 390 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 745 Invalid, 0 Unknown, 51 Unchecked, 0.5s Time] [2023-02-16 01:09:05,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-16 01:09:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2023-02-16 01:09:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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-16 01:09:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-02-16 01:09:05,176 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 42 [2023-02-16 01:09:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:09:05,177 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-02-16 01:09:05,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 36 states have internal predecessors, (64), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 01:09:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-02-16 01:09:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 01:09:05,179 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:09:05,179 INFO L195 NwaCegarLoop]: trace histogram [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-16 01:09:05,207 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-16 01:09:05,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:05,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:09:05,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:09:05,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1294861784, now seen corresponding path program 1 times [2023-02-16 01:09:05,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:09:05,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223707636] [2023-02-16 01:09:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:09:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:09:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:09:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:06,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:09:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:07,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:09:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:09:07,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:09:07,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223707636] [2023-02-16 01:09:07,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223707636] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:07,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636055872] [2023-02-16 01:09:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:09:07,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:07,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:09:07,244 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-16 01:09:07,265 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-16 01:09:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:07,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 152 conjunts are in the unsatisfiable core [2023-02-16 01:09:07,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:09:07,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:09:07,528 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-16 01:09:07,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:07,640 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-16 01:09:07,699 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-16 01:09:07,701 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-16 01:09:07,902 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:09:07,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2023-02-16 01:09:07,921 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-16 01:09:08,008 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-16 01:09:08,021 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 20 treesize of output 22 [2023-02-16 01:09:08,028 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-16 01:09:08,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:09:08,373 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 103 treesize of output 46 [2023-02-16 01:09:08,378 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-16 01:09:08,382 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:09:08,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:08,386 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-16 01:09:08,492 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1222 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1222))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1223 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1223))) (exists ((v_ArrVal_1224 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_1224))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 01:09:08,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:08,525 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:09:08,525 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 113 treesize of output 87 [2023-02-16 01:09:08,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:08,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 01:09:08,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:08,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:08,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:08,542 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-16 01:09:08,571 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:09:08,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 01:09:09,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:09,150 INFO L321 Elim1Store]: treesize reduction 135, result has 17.2 percent of original size [2023-02-16 01:09:09,151 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 271 treesize of output 137 [2023-02-16 01:09:09,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:09,178 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2023-02-16 01:09:09,178 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 209 treesize of output 155 [2023-02-16 01:09:09,190 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 43 treesize of output 34 [2023-02-16 01:09:09,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:09,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:09,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:09:09,358 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 119 treesize of output 59 [2023-02-16 01:09:09,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:09,365 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 01:09:09,365 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-02-16 01:09:09,451 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-16 01:09:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-16 01:09:09,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:09:11,592 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 Int) (v_ArrVal_1228 Int) (v_ArrVal_1229 Int)) (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse4 (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|) .cse0 v_ArrVal_1230))) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1229)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1228)) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:09:12,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636055872] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:12,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:09:12,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-02-16 01:09:12,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333484495] [2023-02-16 01:09:12,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:09:12,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-16 01:09:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:09:12,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-16 01:09:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3099, Unknown=2, NotChecked=226, Total=3540 [2023-02-16 01:09:12,831 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 52 states, 50 states have (on average 1.4) internal successors, (70), 44 states have internal predecessors, (70), 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-16 01:09:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:09:17,177 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2023-02-16 01:09:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-16 01:09:17,177 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.4) internal successors, (70), 44 states have internal predecessors, (70), 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 42 [2023-02-16 01:09:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:09:17,178 INFO L225 Difference]: With dead ends: 52 [2023-02-16 01:09:17,178 INFO L226 Difference]: Without dead ends: 50 [2023-02-16 01:09:17,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=647, Invalid=5365, Unknown=2, NotChecked=306, Total=6320 [2023-02-16 01:09:17,180 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 252 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 01:09:17,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 300 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 838 Invalid, 0 Unknown, 45 Unchecked, 0.7s Time] [2023-02-16 01:09:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-16 01:09:17,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2023-02-16 01:09:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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-16 01:09:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-02-16 01:09:17,190 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 42 [2023-02-16 01:09:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:09:17,190 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-02-16 01:09:17,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.4) internal successors, (70), 44 states have internal predecessors, (70), 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-16 01:09:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-02-16 01:09:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 01:09:17,191 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:09:17,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:09:17,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-16 01:09:17,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:17,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:09:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:09:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash 848307608, now seen corresponding path program 2 times [2023-02-16 01:09:17,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:09:17,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012810033] [2023-02-16 01:09:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:09:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:09:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:18,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:09:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:18,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:09:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:18,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:09:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:09:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:09:19,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012810033] [2023-02-16 01:09:19,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012810033] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:19,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132666830] [2023-02-16 01:09:19,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:09:19,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:19,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:09:19,002 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-16 01:09:19,042 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-16 01:09:19,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:09:19,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:09:19,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 147 conjunts are in the unsatisfiable core [2023-02-16 01:09:19,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:09:19,251 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-16 01:09:19,327 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-16 01:09:19,490 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-16 01:09:19,582 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 01:09:19,582 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 16 treesize of output 22 [2023-02-16 01:09:19,588 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-16 01:09:19,609 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:09:19,610 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-16 01:09:19,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:19,701 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-16 01:09:19,713 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 23 treesize of output 22 [2023-02-16 01:09:19,717 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-16 01:09:19,997 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-16 01:09:19,997 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 56 [2023-02-16 01:09:20,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,005 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 23 treesize of output 15 [2023-02-16 01:09:20,009 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-16 01:09:20,013 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-16 01:09:20,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,213 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-16 01:09:20,213 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 98 treesize of output 88 [2023-02-16 01:09:20,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,220 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-16 01:09:20,236 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:09:20,236 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-16 01:09:20,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,242 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 39 treesize of output 44 [2023-02-16 01:09:20,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:20,824 INFO L321 Elim1Store]: treesize reduction 302, result has 15.4 percent of original size [2023-02-16 01:09:20,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 20 case distinctions, treesize of input 315 treesize of output 145 [2023-02-16 01:09:20,828 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-16 01:09:20,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,839 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-16 01:09:20,839 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 104 treesize of output 86 [2023-02-16 01:09:20,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,978 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-02-16 01:09:20,979 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 116 [2023-02-16 01:09:20,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:21,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:09:21,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 133 [2023-02-16 01:09:21,190 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-16 01:09:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:09:21,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:09:22,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132666830] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:22,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:09:22,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2023-02-16 01:09:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694634003] [2023-02-16 01:09:22,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:09:22,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-16 01:09:22,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:09:22,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-16 01:09:22,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3199, Unknown=28, NotChecked=0, Total=3422 [2023-02-16 01:09:22,383 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 42 states have internal predecessors, (69), 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-16 01:09:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:09:26,659 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-02-16 01:09:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-16 01:09:26,660 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 42 states have internal predecessors, (69), 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 42 [2023-02-16 01:09:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:09:26,661 INFO L225 Difference]: With dead ends: 86 [2023-02-16 01:09:26,661 INFO L226 Difference]: Without dead ends: 84 [2023-02-16 01:09:26,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=510, Invalid=5938, Unknown=32, NotChecked=0, Total=6480 [2023-02-16 01:09:26,663 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 131 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:09:26,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 473 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 01:09:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-16 01:09:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2023-02-16 01:09:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 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-16 01:09:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2023-02-16 01:09:26,688 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 42 [2023-02-16 01:09:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:09:26,689 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2023-02-16 01:09:26,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 42 states have internal predecessors, (69), 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-16 01:09:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2023-02-16 01:09:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 01:09:26,691 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:09:26,691 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-16 01:09:26,701 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-16 01:09:26,901 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,SelfDestructingSolverStorable10 [2023-02-16 01:09:26,901 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:09:26,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:09:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1178308631, now seen corresponding path program 2 times [2023-02-16 01:09:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:09:26,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459753383] [2023-02-16 01:09:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:09:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:09:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:09:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:27,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:09:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:28,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:09:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:09:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:09:28,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459753383] [2023-02-16 01:09:28,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459753383] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:28,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602131291] [2023-02-16 01:09:28,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:09:28,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:28,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:09:28,264 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-16 01:09:28,266 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-16 01:09:28,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:09:28,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:09:28,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 152 conjunts are in the unsatisfiable core [2023-02-16 01:09:28,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:09:28,438 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-16 01:09:28,485 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-16 01:09:28,599 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:09:28,599 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-16 01:09:28,706 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-16 01:09:28,756 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 14 treesize of output 15 [2023-02-16 01:09:28,761 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 14 treesize of output 15 [2023-02-16 01:09:28,845 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 01:09:28,846 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 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 01:09:28,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:28,929 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 13 [2023-02-16 01:09:28,937 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:28,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13 [2023-02-16 01:09:29,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:09:29,184 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 37 [2023-02-16 01:09:29,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-02-16 01:09:29,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 01:09:29,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:29,358 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:09:29,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 84 treesize of output 70 [2023-02-16 01:09:29,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:29,373 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 01:09:29,373 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 38 [2023-02-16 01:09:29,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:29,394 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:09:29,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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-16 01:09:29,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:29,910 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:29,930 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2023-02-16 01:09:29,930 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 207 treesize of output 105 [2023-02-16 01:09:29,953 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2023-02-16 01:09:29,953 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 303 treesize of output 197 [2023-02-16 01:09:30,302 INFO L321 Elim1Store]: treesize reduction 120, result has 54.0 percent of original size [2023-02-16 01:09:30,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 488 treesize of output 440 [2023-02-16 01:09:31,646 INFO L321 Elim1Store]: treesize reduction 82, result has 49.7 percent of original size [2023-02-16 01:09:31,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 260 treesize of output 174 [2023-02-16 01:09:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:09:31,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:09:33,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602131291] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:33,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:09:33,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 50 [2023-02-16 01:09:33,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501244891] [2023-02-16 01:09:33,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:09:33,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-16 01:09:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:09:33,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-16 01:09:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3463, Unknown=0, NotChecked=0, Total=3660 [2023-02-16 01:09:33,175 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 50 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 41 states have internal predecessors, (70), 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-16 01:09:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:09:36,518 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2023-02-16 01:09:36,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 01:09:36,518 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 41 states have internal predecessors, (70), 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 44 [2023-02-16 01:09:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:09:36,519 INFO L225 Difference]: With dead ends: 74 [2023-02-16 01:09:36,519 INFO L226 Difference]: Without dead ends: 71 [2023-02-16 01:09:36,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=577, Invalid=5585, Unknown=0, NotChecked=0, Total=6162 [2023-02-16 01:09:36,521 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 189 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 01:09:36,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 433 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 01:09:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-16 01:09:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2023-02-16 01:09:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 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-16 01:09:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2023-02-16 01:09:36,538 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 44 [2023-02-16 01:09:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:09:36,538 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2023-02-16 01:09:36,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 41 states have internal predecessors, (70), 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-16 01:09:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2023-02-16 01:09:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 01:09:36,539 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:09:36,539 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-16 01:09:36,547 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-16 01:09:36,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:36,745 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:09:36,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:09:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1178306957, now seen corresponding path program 2 times [2023-02-16 01:09:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:09:36,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088321844] [2023-02-16 01:09:36,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:09:36,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:09:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:38,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:09:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:38,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:09:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:09:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:09:38,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:09:38,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088321844] [2023-02-16 01:09:38,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088321844] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:38,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971801549] [2023-02-16 01:09:38,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:09:38,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:38,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:09:38,497 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-16 01:09:38,499 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-16 01:09:38,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:09:38,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:09:38,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 167 conjunts are in the unsatisfiable core [2023-02-16 01:09:38,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:09:38,711 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-16 01:09:38,851 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-16 01:09:38,963 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= |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_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0)) is different from false [2023-02-16 01:09:38,965 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= |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_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0)) is different from true [2023-02-16 01:09:38,978 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-16 01:09:38,983 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-16 01:09:38,994 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 01:09:38,996 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-16 01:09:39,065 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-16 01:09:39,067 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-16 01:09:39,096 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0)))) is different from false [2023-02-16 01:09:39,098 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0)))) is different from true [2023-02-16 01:09:39,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:09:39,112 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 31 [2023-02-16 01:09:39,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:09:39,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:09:39,137 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|)) is different from false [2023-02-16 01:09:39,139 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|)) is different from true [2023-02-16 01:09:39,155 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_~data#1| |c_node_create_#in~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from false [2023-02-16 01:09:39,157 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_~data#1| |c_node_create_#in~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-16 01:09:39,182 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-16 01:09:39,202 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 0) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1751 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1751))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1749 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1749))) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|))) is different from false [2023-02-16 01:09:39,203 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 0) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1751 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1751))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1749 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1749))) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|))) is different from true [2023-02-16 01:09:39,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:39,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:39,238 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:09:39,238 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 25 treesize of output 30 [2023-02-16 01:09:39,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:39,260 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:09:39,260 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 62 treesize of output 58 [2023-02-16 01:09:39,293 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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (<= (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (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_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)))) is different from false [2023-02-16 01:09:39,295 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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (<= (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (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_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)))) is different from true [2023-02-16 01:09:39,341 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (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 (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (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| .cse1) 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-02-16 01:09:39,343 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (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 (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (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| .cse1) 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)))) is different from true [2023-02-16 01:09:39,386 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 ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-02-16 01:09:39,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 ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)))) is different from true [2023-02-16 01:09:39,483 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (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 |c_#memory_$Pointer$.base| .cse4)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ .cse7 4)) (.cse6 (select .cse0 4)) (.cse2 (select |c_#memory_$Pointer$.offset| .cse4))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse2 .cse1)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1))) (<= (+ .cse6 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (= (select .cse2 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-02-16 01:09:39,486 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (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 |c_#memory_$Pointer$.base| .cse4)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ .cse7 4)) (.cse6 (select .cse0 4)) (.cse2 (select |c_#memory_$Pointer$.offset| .cse4))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse2 .cse1)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1))) (<= (+ .cse6 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (= (select .cse2 4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|))))) is different from true [2023-02-16 01:09:39,532 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (= (select .cse7 4) 0))))) is different from false [2023-02-16 01:09:39,535 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (= (select .cse7 4) 0))))) is different from true [2023-02-16 01:09:39,583 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= (select .cse7 4) 0))))) is different from false [2023-02-16 01:09:39,586 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= (select .cse7 4) 0))))) is different from true [2023-02-16 01:09:39,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:39,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:39,626 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-16 01:09:39,627 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 223 treesize of output 127 [2023-02-16 01:09:39,655 INFO L321 Elim1Store]: treesize reduction 172, result has 11.3 percent of original size [2023-02-16 01:09:39,656 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 288 treesize of output 172 [2023-02-16 01:09:39,696 INFO L321 Elim1Store]: treesize reduction 93, result has 49.5 percent of original size [2023-02-16 01:09:39,696 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 62 treesize of output 116 [2023-02-16 01:09:39,725 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-16 01:09:39,741 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|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse8)) (.cse7 (+ .cse6 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) .cse7))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse2)) (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0))) (= .cse5 0) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (or (= (select (select |c_#memory_int| .cse2) 0) |c_ULTIMATE.start_main_~data~0#1|) (= .cse2 .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse7) 0))))))) is different from false [2023-02-16 01:09:39,745 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|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse8)) (.cse7 (+ .cse6 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) .cse7))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse2)) (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0))) (= .cse5 0) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (or (= (select (select |c_#memory_int| .cse2) 0) |c_ULTIMATE.start_main_~data~0#1|) (= .cse2 .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse7) 0))))))) is different from true [2023-02-16 01:09:39,933 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse3)) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse5 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= (select (select |c_#memory_int| .cse3) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse7))))))))) is different from false [2023-02-16 01:09:39,937 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse3)) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse5 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= (select (select |c_#memory_int| .cse3) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse7))))))))) is different from true [2023-02-16 01:09:40,028 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse3 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse3) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-02-16 01:09:40,031 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse3 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse3) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-02-16 01:09:40,109 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse3)) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse5 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= (select (select |c_#memory_int| .cse3) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse6))))))))) is different from false [2023-02-16 01:09:40,111 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse5 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse3 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse3)) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_30| .cse4))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse5 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= (select (select |c_#memory_int| .cse3) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse6))))))))) is different from true [2023-02-16 01:09:40,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:40,131 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2023-02-16 01:09:40,131 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 339 treesize of output 130 [2023-02-16 01:09:40,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:40,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:40,145 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:09:40,145 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 30 [2023-02-16 01:09:40,163 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~temp~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_#t~mem15#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:09:40,164 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~temp~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_#t~mem15#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|)) is different from true [2023-02-16 01:09:40,183 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0))))) is different from false [2023-02-16 01:09:40,185 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0))))) is different from true [2023-02-16 01:09:40,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:40,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-16 01:09:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2023-02-16 01:09:40,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:09:41,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:09:41,061 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 1880 treesize of output 1872 [2023-02-16 01:09:41,124 INFO L321 Elim1Store]: treesize reduction 4, result has 99.9 percent of original size [2023-02-16 01:09:41,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4636 treesize of output 6449 [2023-02-16 01:09:41,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:09:41,144 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 2164 treesize of output 2168 [2023-02-16 01:09:46,442 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse360 (not (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|))) (.cse417 (= |c_ULTIMATE.start_sll_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|))) (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse13 (select (select .cse10 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse14 (+ (select (select .cse12 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse11 (select (select .cse10 .cse13) .cse14))) (let ((.cse4 (select .cse12 .cse11)) (.cse5 (+ (select (select .cse12 .cse13) .cse14) 4))) (let ((.cse1 (store .cse12 .cse11 (store .cse4 .cse5 0))) (.cse7 (store .cse10 .cse11 (store (select .cse10 .cse11) .cse5 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse1 .cse8) .cse9))) (let ((.cse2 (select (select .cse7 .cse8) .cse9)) (.cse3 (+ .cse0 4))) (let ((.cse6 (select (select .cse7 .cse2) .cse3))) (or (= .cse0 0) (= .cse0 (select (select .cse1 .cse2) .cse3)) (not (= 0 (select .cse4 .cse5))) (= .cse6 .cse2) (= .cse6 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse25 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse27 (select (select .cse25 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse28 (+ (select (select .cse26 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse16 (select (select .cse25 .cse27) .cse28))) (let ((.cse17 (select .cse26 .cse16)) (.cse18 (+ (select (select .cse26 .cse27) .cse28) 4))) (let ((.cse21 (store .cse26 .cse16 (store .cse17 .cse18 0))) (.cse24 (store .cse25 .cse16 (store (select .cse25 .cse16) .cse18 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (+ (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse15 (select (select .cse24 .cse22) .cse23)) (.cse20 (select (select .cse21 .cse22) .cse23))) (let ((.cse19 (select (select .cse21 .cse15) (+ .cse20 4)))) (or (= .cse15 .cse16) (not (= 0 (select .cse17 .cse18))) (= .cse19 .cse20) (= .cse19 0) (= .cse15 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse40 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse41 (select (select .cse39 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse42 (+ (select (select .cse40 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse36 (select (select .cse39 .cse41) .cse42))) (let ((.cse29 (select .cse40 .cse36)) (.cse30 (+ (select (select .cse40 .cse41) .cse42) 4))) (let ((.cse31 (store .cse40 .cse36 (store .cse29 .cse30 0))) (.cse35 (store .cse39 .cse36 (store (select .cse39 .cse36) .cse30 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse37 (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse38 (+ (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse34 (select (select .cse31 .cse37) .cse38))) (let ((.cse33 (+ .cse34 4)) (.cse32 (select (select .cse35 .cse37) .cse38))) (or (not (= 0 (select .cse29 .cse30))) (= (select (select .cse31 .cse32) .cse33) .cse34) (= (select (select .cse35 .cse32) .cse33) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (not (= .cse32 .cse36)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse53 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse55 (select (select .cse53 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse56 (+ (select (select .cse54 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse46 (select (select .cse53 .cse55) .cse56))) (let ((.cse47 (select .cse54 .cse46)) (.cse48 (+ (select (select .cse54 .cse55) .cse56) 4))) (let ((.cse49 (store .cse54 .cse46 (store .cse47 .cse48 0))) (.cse43 (store .cse53 .cse46 (store (select .cse53 .cse46) .cse48 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse51 (select (select .cse43 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (+ (select (select .cse49 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse50 (select (select .cse49 .cse51) .cse52))) (let ((.cse45 (+ .cse50 4)) (.cse44 (select (select .cse43 .cse51) .cse52))) (or (not (= (select (select .cse43 .cse44) .cse45) .cse46)) (not (= 0 (select .cse47 .cse48))) (= (select (select .cse49 .cse44) .cse45) .cse50) (not (= .cse44 .cse46)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse67 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse69 (select (select .cse67 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse70 (+ (select (select .cse68 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse59 (select (select .cse67 .cse69) .cse70))) (let ((.cse60 (select .cse68 .cse59)) (.cse61 (+ (select (select .cse68 .cse69) .cse70) 4))) (let ((.cse64 (store .cse68 .cse59 (store .cse60 .cse61 0))) (.cse63 (store .cse67 .cse59 (store (select .cse67 .cse59) .cse61 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse65 (select (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse66 (+ (select (select .cse64 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse58 (select (select .cse63 .cse65) .cse66)) (.cse57 (select (select .cse64 .cse65) .cse66))) (let ((.cse62 (select (select .cse63 .cse58) (+ .cse57 4)))) (or (= .cse57 0) (= .cse58 .cse59) (not (= 0 (select .cse60 .cse61))) (= .cse62 .cse58) (= .cse62 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse82 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse81 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse83 (select (select .cse81 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse84 (+ (select (select .cse82 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse76 (select (select .cse81 .cse83) .cse84))) (let ((.cse71 (select .cse82 .cse76)) (.cse72 (+ (select (select .cse82 .cse83) .cse84) 4))) (let ((.cse77 (store .cse82 .cse76 (store .cse71 .cse72 0))) (.cse80 (store .cse81 .cse76 (store (select .cse81 .cse76) .cse72 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse78 (select (select .cse80 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse79 (+ (select (select .cse77 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse75 (select (select .cse80 .cse78) .cse79)) (.cse74 (select (select .cse77 .cse78) .cse79))) (let ((.cse73 (select (select .cse77 .cse75) (+ .cse74 4)))) (or (not (= 0 (select .cse71 .cse72))) (= .cse73 .cse74) (= .cse73 0) (not (= .cse75 .cse76)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse96 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse94 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse97 (select (select .cse94 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse98 (+ (select (select .cse96 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse95 (select (select .cse94 .cse97) .cse98))) (let ((.cse89 (select .cse96 .cse95)) (.cse90 (+ (select (select .cse96 .cse97) .cse98) 4))) (let ((.cse86 (store .cse96 .cse95 (store .cse89 .cse90 0))) (.cse91 (store .cse94 .cse95 (store (select .cse94 .cse95) .cse90 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse92 (select (select .cse91 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse93 (+ (select (select .cse86 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse85 (select (select .cse86 .cse92) .cse93))) (let ((.cse87 (select (select .cse91 .cse92) .cse93)) (.cse88 (+ .cse85 4))) (or (= .cse85 0) (= .cse85 (select (select .cse86 .cse87) .cse88)) (not (= 0 (select .cse89 .cse90))) (= (select (select .cse91 .cse87) .cse88) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse108 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse110 (select (select .cse108 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse111 (+ (select (select .cse109 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse103 (select (select .cse108 .cse110) .cse111))) (let ((.cse99 (select .cse109 .cse103)) (.cse100 (+ (select (select .cse109 .cse110) .cse111) 4))) (let ((.cse105 (store .cse109 .cse103 (store .cse99 .cse100 0))) (.cse104 (store .cse108 .cse103 (store (select .cse108 .cse103) .cse100 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse106 (select (select .cse104 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse107 (+ (select (select .cse105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse102 (select (select .cse104 .cse106) .cse107))) (let ((.cse101 (select (select .cse104 .cse102) (+ (select (select .cse105 .cse106) .cse107) 4)))) (or (not (= 0 (select .cse99 .cse100))) (= .cse101 .cse102) (= .cse101 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (not (= .cse102 .cse103)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse123 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse122 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse124 (select (select .cse122 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse125 (+ (select (select .cse123 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse115 (select (select .cse122 .cse124) .cse125))) (let ((.cse118 (select .cse123 .cse115)) (.cse119 (+ (select (select .cse123 .cse124) .cse125) 4))) (let ((.cse117 (store .cse123 .cse115 (store .cse118 .cse119 0))) (.cse112 (store .cse122 .cse115 (store (select .cse122 .cse115) .cse119 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse120 (select (select .cse112 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse121 (+ (select (select .cse117 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse116 (select (select .cse117 .cse120) .cse121))) (let ((.cse114 (+ .cse116 4)) (.cse113 (select (select .cse112 .cse120) .cse121))) (or (not (= (select (select .cse112 .cse113) .cse114) .cse115)) (= .cse116 (select (select .cse117 .cse113) .cse114)) (not (= 0 (select .cse118 .cse119))) (not (= .cse113 .cse115)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse137 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse136 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse138 (select (select .cse136 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse139 (+ (select (select .cse137 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse129 (select (select .cse136 .cse138) .cse139))) (let ((.cse132 (select .cse137 .cse129)) (.cse133 (+ (select (select .cse137 .cse138) .cse139) 4))) (let ((.cse131 (store .cse137 .cse129 (store .cse132 .cse133 0))) (.cse126 (store .cse136 .cse129 (store (select .cse136 .cse129) .cse133 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse134 (select (select .cse126 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse135 (+ (select (select .cse131 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse130 (select (select .cse131 .cse134) .cse135))) (let ((.cse128 (+ .cse130 4)) (.cse127 (select (select .cse126 .cse134) .cse135))) (or (not (= (select (select .cse126 .cse127) .cse128) .cse129)) (= .cse130 (select (select .cse131 .cse127) .cse128)) (not (= 0 (select .cse132 .cse133))) (= .cse127 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse149 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse148 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse150 (select (select .cse148 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse151 (+ (select (select .cse149 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse145 (select (select .cse148 .cse150) .cse151))) (let ((.cse146 (select .cse149 .cse145)) (.cse147 (+ (select (select .cse149 .cse150) .cse151) 4))) (let ((.cse142 (store .cse149 .cse145 (store .cse146 .cse147 0))) (.cse140 (store .cse148 .cse145 (store (select .cse148 .cse145) .cse147 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse143 (select (select .cse140 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse144 (+ (select (select .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse141 (select (select .cse140 .cse143) .cse144))) (or (not (= (select (select .cse140 .cse141) (+ (select (select .cse142 .cse143) .cse144) 4)) .cse145)) (= .cse141 .cse145) (not (= 0 (select .cse146 .cse147))) (= .cse141 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse163 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse165 (select (select .cse163 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse166 (+ (select (select .cse164 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse153 (select (select .cse163 .cse165) .cse166))) (let ((.cse158 (select .cse164 .cse153)) (.cse159 (+ (select (select .cse164 .cse165) .cse166) 4))) (let ((.cse155 (store .cse164 .cse153 (store .cse158 .cse159 0))) (.cse160 (store .cse163 .cse153 (store (select .cse163 .cse153) .cse159 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse161 (select (select .cse160 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse162 (+ (select (select .cse155 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse154 (select (select .cse155 .cse161) .cse162))) (let ((.cse156 (select (select .cse160 .cse161) .cse162)) (.cse157 (+ .cse154 4))) (let ((.cse152 (select (select .cse160 .cse156) .cse157))) (or (not (= .cse152 .cse153)) (= .cse154 0) (= .cse154 (select (select .cse155 .cse156) .cse157)) (not (= 0 (select .cse158 .cse159))) (= .cse152 .cse156)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse178 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse177 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse179 (select (select .cse177 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse180 (+ (select (select .cse178 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse168 (select (select .cse177 .cse179) .cse180))) (let ((.cse169 (select .cse178 .cse168)) (.cse170 (+ (select (select .cse178 .cse179) .cse180) 4))) (let ((.cse171 (store .cse178 .cse168 (store .cse169 .cse170 0))) (.cse174 (store .cse177 .cse168 (store (select .cse177 .cse168) .cse170 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse175 (select (select .cse174 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse176 (+ (select (select .cse171 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse173 (select (select .cse171 .cse175) .cse176))) (let ((.cse172 (+ .cse173 4)) (.cse167 (select (select .cse174 .cse175) .cse176))) (or (= .cse167 .cse168) (not (= 0 (select .cse169 .cse170))) (= (select (select .cse171 .cse167) .cse172) .cse173) (= (select (select .cse174 .cse167) .cse172) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (= .cse167 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse193 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse192 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse194 (select (select .cse192 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse195 (+ (select (select .cse193 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse188 (select (select .cse192 .cse194) .cse195))) (let ((.cse183 (select .cse193 .cse188)) (.cse184 (+ (select (select .cse193 .cse194) .cse195) 4))) (let ((.cse189 (store .cse193 .cse188 (store .cse183 .cse184 0))) (.cse185 (store .cse192 .cse188 (store (select .cse192 .cse188) .cse184 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse190 (select (select .cse185 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse191 (+ (select (select .cse189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse181 (select (select .cse189 .cse190) .cse191))) (let ((.cse186 (select (select .cse185 .cse190) .cse191)) (.cse187 (+ .cse181 4))) (let ((.cse182 (select (select .cse189 .cse186) .cse187))) (or (= .cse181 .cse182) (not (= 0 (select .cse183 .cse184))) (= (select (select .cse185 .cse186) .cse187) .cse186) (= .cse182 0) (not (= .cse186 .cse188))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse206 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse205 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse207 (select (select .cse205 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse208 (+ (select (select .cse206 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse197 (select (select .cse205 .cse207) .cse208))) (let ((.cse198 (select .cse206 .cse197)) (.cse199 (+ (select (select .cse206 .cse207) .cse208) 4))) (let ((.cse202 (store .cse206 .cse197 (store .cse198 .cse199 0))) (.cse200 (store .cse205 .cse197 (store (select .cse205 .cse197) .cse199 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse203 (select (select .cse200 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse204 (+ (select (select .cse202 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse201 (+ (select (select .cse202 .cse203) .cse204) 4)) (.cse196 (select (select .cse200 .cse203) .cse204))) (or (= .cse196 .cse197) (not (= 0 (select .cse198 .cse199))) (= (select (select .cse200 .cse196) .cse201) .cse196) (= (select (select .cse202 .cse196) .cse201) 0) (= .cse196 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse221 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse220 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse222 (select (select .cse220 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse223 (+ (select (select .cse221 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse216 (select (select .cse220 .cse222) .cse223))) (let ((.cse213 (select .cse221 .cse216)) (.cse214 (+ (select (select .cse221 .cse222) .cse223) 4))) (let ((.cse210 (store .cse221 .cse216 (store .cse213 .cse214 0))) (.cse217 (store .cse220 .cse216 (store (select .cse220 .cse216) .cse214 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse218 (select (select .cse217 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse219 (+ (select (select .cse210 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse209 (select (select .cse210 .cse218) .cse219))) (let ((.cse211 (select (select .cse217 .cse218) .cse219)) (.cse212 (+ .cse209 4))) (let ((.cse215 (select (select .cse217 .cse211) .cse212))) (or (= .cse209 (select (select .cse210 .cse211) .cse212)) (not (= 0 (select .cse213 .cse214))) (= .cse215 .cse211) (= .cse215 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (not (= .cse211 .cse216))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse236 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse235 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse237 (select (select .cse235 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse238 (+ (select (select .cse236 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse225 (select (select .cse235 .cse237) .cse238))) (let ((.cse230 (select .cse236 .cse225)) (.cse231 (+ (select (select .cse236 .cse237) .cse238) 4))) (let ((.cse227 (store .cse236 .cse225 (store .cse230 .cse231 0))) (.cse232 (store .cse235 .cse225 (store (select .cse235 .cse225) .cse231 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse233 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse234 (+ (select (select .cse227 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse226 (select (select .cse227 .cse233) .cse234))) (let ((.cse228 (select (select .cse232 .cse233) .cse234)) (.cse229 (+ .cse226 4))) (let ((.cse224 (select (select .cse232 .cse228) .cse229))) (or (not (= .cse224 .cse225)) (= .cse226 (select (select .cse227 .cse228) .cse229)) (not (= 0 (select .cse230 .cse231))) (= .cse224 .cse228) (= .cse228 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse250 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse249 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse251 (select (select .cse249 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse252 (+ (select (select .cse250 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse242 (select (select .cse249 .cse251) .cse252))) (let ((.cse245 (select .cse250 .cse242)) (.cse246 (+ (select (select .cse250 .cse251) .cse252) 4))) (let ((.cse244 (store .cse250 .cse242 (store .cse245 .cse246 0))) (.cse239 (store .cse249 .cse242 (store (select .cse249 .cse242) .cse246 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse247 (select (select .cse239 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse248 (+ (select (select .cse244 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse243 (select (select .cse244 .cse247) .cse248))) (let ((.cse240 (select (select .cse239 .cse247) .cse248)) (.cse241 (+ .cse243 4))) (or (not (= (select (select .cse239 .cse240) .cse241) .cse242)) (= .cse243 0) (= .cse243 (select (select .cse244 .cse240) .cse241)) (not (= 0 (select .cse245 .cse246))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse263 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse262 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse264 (select (select .cse262 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse265 (+ (select (select .cse263 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse259 (select (select .cse262 .cse264) .cse265))) (let ((.cse253 (select .cse263 .cse259)) (.cse254 (+ (select (select .cse263 .cse264) .cse265) 4))) (let ((.cse258 (store .cse263 .cse259 (store .cse253 .cse254 0))) (.cse255 (store .cse262 .cse259 (store (select .cse262 .cse259) .cse254 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse260 (select (select .cse255 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse261 (+ (select (select .cse258 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse257 (+ (select (select .cse258 .cse260) .cse261) 4)) (.cse256 (select (select .cse255 .cse260) .cse261))) (or (not (= 0 (select .cse253 .cse254))) (= (select (select .cse255 .cse256) .cse257) .cse256) (= (select (select .cse258 .cse256) .cse257) 0) (not (= .cse256 .cse259))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse277 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse276 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse278 (select (select .cse276 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse279 (+ (select (select .cse277 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse268 (select (select .cse276 .cse278) .cse279))) (let ((.cse269 (select .cse277 .cse268)) (.cse270 (+ (select (select .cse277 .cse278) .cse279) 4))) (let ((.cse273 (store .cse277 .cse268 (store .cse269 .cse270 0))) (.cse271 (store .cse276 .cse268 (store (select .cse276 .cse268) .cse270 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse274 (select (select .cse271 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse275 (+ (select (select .cse273 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse266 (select (select .cse273 .cse274) .cse275))) (let ((.cse267 (select (select .cse271 .cse274) .cse275)) (.cse272 (+ .cse266 4))) (or (= .cse266 0) (= .cse267 .cse268) (not (= 0 (select .cse269 .cse270))) (= (select (select .cse271 .cse267) .cse272) .cse267) (= (select (select .cse273 .cse267) .cse272) 0))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse291 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse289 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse292 (select (select .cse289 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse293 (+ (select (select .cse291 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse290 (select (select .cse289 .cse292) .cse293))) (let ((.cse280 (select .cse291 .cse290)) (.cse281 (+ (select (select .cse291 .cse292) .cse293) 4))) (let ((.cse282 (store .cse291 .cse290 (store .cse280 .cse281 0))) (.cse286 (store .cse289 .cse290 (store (select .cse289 .cse290) .cse281 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse287 (select (select .cse286 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse288 (+ (select (select .cse282 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse285 (select (select .cse282 .cse287) .cse288))) (let ((.cse283 (select (select .cse286 .cse287) .cse288)) (.cse284 (+ .cse285 4))) (or (not (= 0 (select .cse280 .cse281))) (= (select (select .cse282 .cse283) .cse284) .cse285) (= (select (select .cse286 .cse283) .cse284) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse304 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse303 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse305 (select (select .cse303 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse306 (+ (select (select .cse304 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse295 (select (select .cse303 .cse305) .cse306))) (let ((.cse296 (select .cse304 .cse295)) (.cse297 (+ (select (select .cse304 .cse305) .cse306) 4))) (let ((.cse300 (store .cse304 .cse295 (store .cse296 .cse297 0))) (.cse299 (store .cse303 .cse295 (store (select .cse303 .cse295) .cse297 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse301 (select (select .cse299 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse302 (+ (select (select .cse300 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse298 (select (select .cse299 .cse301) .cse302))) (let ((.cse294 (select (select .cse299 .cse298) (+ (select (select .cse300 .cse301) .cse302) 4)))) (or (not (= .cse294 .cse295)) (not (= 0 (select .cse296 .cse297))) (= .cse294 .cse298))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse317 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse315 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse318 (select (select .cse315 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse319 (+ (select (select .cse317 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse316 (select (select .cse315 .cse318) .cse319))) (let ((.cse307 (select .cse317 .cse316)) (.cse308 (+ (select (select .cse317 .cse318) .cse319) 4))) (let ((.cse312 (store .cse317 .cse316 (store .cse307 .cse308 0))) (.cse311 (store .cse315 .cse316 (store (select .cse315 .cse316) .cse308 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse313 (select (select .cse311 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse314 (+ (select (select .cse312 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse310 (select (select .cse311 .cse313) .cse314))) (let ((.cse309 (select (select .cse311 .cse310) (+ (select (select .cse312 .cse313) .cse314) 4)))) (or (not (= 0 (select .cse307 .cse308))) (= .cse309 .cse310) (= .cse309 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse331 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse330 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse332 (select (select .cse330 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse333 (+ (select (select .cse331 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse323 (select (select .cse330 .cse332) .cse333))) (let ((.cse324 (select .cse331 .cse323)) (.cse325 (+ (select (select .cse331 .cse332) .cse333) 4))) (let ((.cse326 (store .cse331 .cse323 (store .cse324 .cse325 0))) (.cse320 (store .cse330 .cse323 (store (select .cse330 .cse323) .cse325 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse328 (select (select .cse320 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse329 (+ (select (select .cse326 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse327 (select (select .cse326 .cse328) .cse329))) (let ((.cse321 (select (select .cse320 .cse328) .cse329)) (.cse322 (+ .cse327 4))) (or (not (= (select (select .cse320 .cse321) .cse322) .cse323)) (not (= 0 (select .cse324 .cse325))) (= (select (select .cse326 .cse321) .cse322) .cse327))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse344 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse342 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse345 (select (select .cse342 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse346 (+ (select (select .cse344 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse343 (select (select .cse342 .cse345) .cse346))) (let ((.cse334 (select .cse344 .cse343)) (.cse335 (+ (select (select .cse344 .cse345) .cse346) 4))) (let ((.cse338 (store .cse344 .cse343 (store .cse334 .cse335 0))) (.cse339 (store .cse342 .cse343 (store (select .cse342 .cse343) .cse335 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse340 (select (select .cse339 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse341 (+ (select (select .cse338 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse337 (select (select .cse338 .cse340) .cse341))) (let ((.cse336 (select (select .cse338 (select (select .cse339 .cse340) .cse341)) (+ .cse337 4)))) (or (not (= 0 (select .cse334 .cse335))) (= .cse336 .cse337) (= .cse336 0))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse357 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse355 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse358 (select (select .cse355 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse359 (+ (select (select .cse357 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse356 (select (select .cse355 .cse358) .cse359))) (let ((.cse347 (select .cse357 .cse356)) (.cse348 (+ (select (select .cse357 .cse358) .cse359) 4))) (let ((.cse352 (store .cse357 .cse356 (store .cse347 .cse348 0))) (.cse349 (store .cse355 .cse356 (store (select .cse355 .cse356) .cse348 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse353 (select (select .cse349 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse354 (+ (select (select .cse352 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse350 (select (select .cse349 .cse353) .cse354)) (.cse351 (+ (select (select .cse352 .cse353) .cse354) 4))) (or (not (= 0 (select .cse347 .cse348))) (= (select (select .cse349 .cse350) .cse351) .cse350) (= (select (select .cse352 .cse350) .cse351) 0)))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))) .cse360) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse373 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse371 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse374 (select (select .cse371 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse375 (+ (select (select .cse373 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse372 (select (select .cse371 .cse374) .cse375))) (let ((.cse365 (select .cse373 .cse372)) (.cse366 (+ (select (select .cse373 .cse374) .cse375) 4))) (let ((.cse362 (store .cse373 .cse372 (store .cse365 .cse366 0))) (.cse368 (store .cse371 .cse372 (store (select .cse371 .cse372) .cse366 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse369 (select (select .cse368 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse370 (+ (select (select .cse362 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse361 (select (select .cse362 .cse369) .cse370))) (let ((.cse363 (select (select .cse368 .cse369) .cse370)) (.cse364 (+ .cse361 4))) (let ((.cse367 (select (select .cse368 .cse363) .cse364))) (or (= .cse361 (select (select .cse362 .cse363) .cse364)) (not (= 0 (select .cse365 .cse366))) (= .cse367 .cse363) (= .cse367 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (= .cse363 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse387 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse386 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse388 (select (select .cse386 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse389 (+ (select (select .cse387 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse378 (select (select .cse386 .cse388) .cse389))) (let ((.cse379 (select .cse387 .cse378)) (.cse380 (+ (select (select .cse387 .cse388) .cse389) 4))) (let ((.cse382 (store .cse387 .cse378 (store .cse379 .cse380 0))) (.cse385 (store .cse386 .cse378 (store (select .cse386 .cse378) .cse380 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse383 (select (select .cse385 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse384 (+ (select (select .cse382 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse377 (select (select .cse385 .cse383) .cse384)) (.cse376 (select (select .cse382 .cse383) .cse384))) (let ((.cse381 (select (select .cse382 .cse377) (+ .cse376 4)))) (or (= .cse376 0) (= .cse377 .cse378) (not (= 0 (select .cse379 .cse380))) (= .cse381 .cse376) (= .cse381 0))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse401 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse399 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse402 (select (select .cse399 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse403 (+ (select (select .cse401 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse400 (select (select .cse399 .cse402) .cse403))) (let ((.cse394 (select .cse401 .cse400)) (.cse395 (+ (select (select .cse401 .cse402) .cse403) 4))) (let ((.cse391 (store .cse401 .cse400 (store .cse394 .cse395 0))) (.cse396 (store .cse399 .cse400 (store (select .cse399 .cse400) .cse395 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse397 (select (select .cse396 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse398 (+ (select (select .cse391 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse390 (select (select .cse391 .cse397) .cse398))) (let ((.cse393 (+ .cse390 4)) (.cse392 (select (select .cse396 .cse397) .cse398))) (or (= .cse390 (select (select .cse391 .cse392) .cse393)) (not (= 0 (select .cse394 .cse395))) (= (select (select .cse396 .cse392) .cse393) .cse392) (= .cse392 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse414 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse412 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse415 (select (select .cse412 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse416 (+ (select (select .cse414 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse413 (select (select .cse412 .cse415) .cse416))) (let ((.cse409 (select .cse414 .cse413)) (.cse410 (+ (select (select .cse414 .cse415) .cse416) 4))) (let ((.cse405 (store .cse414 .cse413 (store .cse409 .cse410 0))) (.cse411 (store .cse412 .cse413 (store (select .cse412 .cse413) .cse410 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse407 (select (select .cse411 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse408 (+ (select (select .cse405 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse406 (select (select .cse411 .cse407) .cse408))) (or (let ((.cse404 (select (select .cse405 .cse407) .cse408))) (= .cse404 (select (select .cse405 .cse406) (+ .cse404 4)))) (not (= 0 (select .cse409 .cse410))) (= .cse406 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))) .cse417) (or .cse417 (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse427 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse425 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse428 (select (select .cse425 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse429 (+ (select (select .cse427 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse426 (select (select .cse425 .cse428) .cse429))) (let ((.cse423 (select .cse427 .cse426)) (.cse424 (+ (select (select .cse427 .cse428) .cse429) 4))) (let ((.cse419 (store .cse427 .cse426 (store .cse423 .cse424 0))) (.cse420 (store .cse425 .cse426 (store (select .cse425 .cse426) .cse424 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse421 (select (select .cse420 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse422 (+ (select (select .cse419 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse418 (select (select .cse419 .cse421) .cse422))) (or (= .cse418 0) (= .cse418 (select (select .cse419 (select (select .cse420 .cse421) .cse422)) (+ .cse418 4))) (not (= 0 (select .cse423 .cse424)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse441 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse439 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse442 (select (select .cse439 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse443 (+ (select (select .cse441 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse440 (select (select .cse439 .cse442) .cse443))) (let ((.cse434 (select .cse441 .cse440)) (.cse435 (+ (select (select .cse441 .cse442) .cse443) 4))) (let ((.cse431 (store .cse441 .cse440 (store .cse434 .cse435 0))) (.cse436 (store .cse439 .cse440 (store (select .cse439 .cse440) .cse435 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse437 (select (select .cse436 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse438 (+ (select (select .cse431 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse430 (select (select .cse431 .cse437) .cse438))) (let ((.cse433 (+ .cse430 4)) (.cse432 (select (select .cse436 .cse437) .cse438))) (or (= .cse430 0) (= .cse430 (select (select .cse431 .cse432) .cse433)) (not (= 0 (select .cse434 .cse435))) (= (select (select .cse436 .cse432) .cse433) .cse432))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse456 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse454 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse457 (select (select .cse454 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse458 (+ (select (select .cse456 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse455 (select (select .cse454 .cse457) .cse458))) (let ((.cse446 (select .cse456 .cse455)) (.cse447 (+ (select (select .cse456 .cse457) .cse458) 4))) (let ((.cse451 (store .cse456 .cse455 (store .cse446 .cse447 0))) (.cse448 (store .cse454 .cse455 (store (select .cse454 .cse455) .cse447 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse452 (select (select .cse448 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse453 (+ (select (select .cse451 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse444 (select (select .cse451 .cse452) .cse453))) (let ((.cse449 (select (select .cse448 .cse452) .cse453)) (.cse450 (+ .cse444 4))) (let ((.cse445 (select (select .cse451 .cse449) .cse450))) (or (= .cse444 .cse445) (not (= 0 (select .cse446 .cse447))) (= (select (select .cse448 .cse449) .cse450) .cse449) (= .cse445 0) (= .cse449 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse470 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse468 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse471 (select (select .cse468 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse472 (+ (select (select .cse470 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse469 (select (select .cse468 .cse471) .cse472))) (let ((.cse463 (select .cse470 .cse469)) (.cse464 (+ (select (select .cse470 .cse471) .cse472) 4))) (let ((.cse460 (store .cse470 .cse469 (store .cse463 .cse464 0))) (.cse465 (store .cse468 .cse469 (store (select .cse468 .cse469) .cse464 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse466 (select (select .cse465 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse467 (+ (select (select .cse460 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse459 (select (select .cse460 .cse466) .cse467))) (let ((.cse462 (+ .cse459 4)) (.cse461 (select (select .cse465 .cse466) .cse467))) (or (= .cse459 (select (select .cse460 .cse461) .cse462)) (not (= 0 (select .cse463 .cse464))) (= (select (select .cse465 .cse461) .cse462) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (= .cse461 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse484 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse483 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse485 (select (select .cse483 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse486 (+ (select (select .cse484 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse475 (select (select .cse483 .cse485) .cse486))) (let ((.cse476 (select .cse484 .cse475)) (.cse477 (+ (select (select .cse484 .cse485) .cse486) 4))) (let ((.cse478 (store .cse484 .cse475 (store .cse476 .cse477 0))) (.cse480 (store .cse483 .cse475 (store (select .cse483 .cse475) .cse477 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse481 (select (select .cse480 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse482 (+ (select (select .cse478 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse473 (select (select .cse478 .cse481) .cse482))) (let ((.cse474 (select (select .cse480 .cse481) .cse482)) (.cse479 (+ .cse473 4))) (or (= .cse473 0) (= .cse474 .cse475) (not (= 0 (select .cse476 .cse477))) (= (select (select .cse478 .cse474) .cse479) .cse473) (= (select (select .cse480 .cse474) .cse479) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse498 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse497 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse499 (select (select .cse497 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse500 (+ (select (select .cse498 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse494 (select (select .cse497 .cse499) .cse500))) (let ((.cse491 (select .cse498 .cse494)) (.cse492 (+ (select (select .cse498 .cse499) .cse500) 4))) (let ((.cse488 (store .cse498 .cse494 (store .cse491 .cse492 0))) (.cse493 (store .cse497 .cse494 (store (select .cse497 .cse494) .cse492 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse495 (select (select .cse493 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse496 (+ (select (select .cse488 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse487 (select (select .cse488 .cse495) .cse496))) (let ((.cse490 (+ .cse487 4)) (.cse489 (select (select .cse493 .cse495) .cse496))) (or (= .cse487 (select (select .cse488 .cse489) .cse490)) (not (= 0 (select .cse491 .cse492))) (= (select (select .cse493 .cse489) .cse490) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (not (= .cse489 .cse494)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or .cse417 (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse511 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse510 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse512 (select (select .cse510 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse513 (+ (select (select .cse511 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse508 (select (select .cse510 .cse512) .cse513))) (let ((.cse501 (select .cse511 .cse508)) (.cse502 (+ (select (select .cse511 .cse512) .cse513) 4))) (let ((.cse503 (store .cse511 .cse508 (store .cse501 .cse502 0))) (.cse509 (store .cse510 .cse508 (store (select .cse510 .cse508) .cse502 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse506 (select (select .cse509 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse507 (+ (select (select .cse503 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse504 (select (select .cse509 .cse506) .cse507))) (or (not (= 0 (select .cse501 .cse502))) (let ((.cse505 (select (select .cse503 .cse506) .cse507))) (= (select (select .cse503 .cse504) (+ .cse505 4)) .cse505)) (not (= .cse504 .cse508))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse523 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse522 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse524 (select (select .cse522 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse525 (+ (select (select .cse523 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse521 (select (select .cse522 .cse524) .cse525))) (let ((.cse514 (select .cse523 .cse521)) (.cse515 (+ (select (select .cse523 .cse524) .cse525) 4))) (let ((.cse518 (store .cse523 .cse521 (store .cse514 .cse515 0))) (.cse516 (store .cse522 .cse521 (store (select .cse522 .cse521) .cse515 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse519 (select (select .cse516 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse520 (+ (select (select .cse518 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse517 (select (select .cse516 .cse519) .cse520))) (or (not (= 0 (select .cse514 .cse515))) (= (select (select .cse516 .cse517) (+ (select (select .cse518 .cse519) .cse520) 4)) .cse517) (not (= .cse517 .cse521))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse536 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse535 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse537 (select (select .cse535 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse538 (+ (select (select .cse536 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse529 (select (select .cse535 .cse537) .cse538))) (let ((.cse530 (select .cse536 .cse529)) (.cse531 (+ (select (select .cse536 .cse537) .cse538) 4))) (let ((.cse534 (store .cse536 .cse529 (store .cse530 .cse531 0))) (.cse526 (store .cse535 .cse529 (store (select .cse535 .cse529) .cse531 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse532 (select (select .cse526 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse533 (+ (select (select .cse534 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse528 (select (select .cse534 .cse532) .cse533)) (.cse527 (select (select .cse526 .cse532) .cse533))) (or (not (= (select (select .cse526 .cse527) (+ .cse528 4)) .cse529)) (= .cse528 0) (= .cse527 .cse529) (not (= 0 (select .cse530 .cse531)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse549 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse548 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse550 (select (select .cse548 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse551 (+ (select (select .cse549 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse540 (select (select .cse548 .cse550) .cse551))) (let ((.cse541 (select .cse549 .cse540)) (.cse542 (+ (select (select .cse549 .cse550) .cse551) 4))) (let ((.cse545 (store .cse549 .cse540 (store .cse541 .cse542 0))) (.cse544 (store .cse548 .cse540 (store (select .cse548 .cse540) .cse542 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse546 (select (select .cse544 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse547 (+ (select (select .cse545 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse539 (select (select .cse544 .cse546) .cse547))) (let ((.cse543 (select (select .cse544 .cse539) (+ (select (select .cse545 .cse546) .cse547) 4)))) (or (= .cse539 .cse540) (not (= 0 (select .cse541 .cse542))) (= .cse543 .cse539) (= .cse543 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|) (= .cse539 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse563 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse561 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse564 (select (select .cse561 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse565 (+ (select (select .cse563 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse562 (select (select .cse561 .cse564) .cse565))) (let ((.cse554 (select .cse563 .cse562)) (.cse555 (+ (select (select .cse563 .cse564) .cse565) 4))) (let ((.cse557 (store .cse563 .cse562 (store .cse554 .cse555 0))) (.cse560 (store .cse561 .cse562 (store (select .cse561 .cse562) .cse555 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse558 (select (select .cse560 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse559 (+ (select (select .cse557 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse556 (select (select .cse560 .cse558) .cse559)) (.cse552 (select (select .cse557 .cse558) .cse559))) (let ((.cse553 (select (select .cse557 .cse556) (+ .cse552 4)))) (or (= .cse552 .cse553) (not (= 0 (select .cse554 .cse555))) (= .cse553 0) (= .cse556 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse576 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse574 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse577 (select (select .cse574 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse578 (+ (select (select .cse576 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse575 (select (select .cse574 .cse577) .cse578))) (let ((.cse568 (select .cse576 .cse575)) (.cse569 (+ (select (select .cse576 .cse577) .cse578) 4))) (let ((.cse570 (store .cse576 .cse575 (store .cse568 .cse569 0))) (.cse571 (store .cse574 .cse575 (store (select .cse574 .cse575) .cse569 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse572 (select (select .cse571 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse573 (+ (select (select .cse570 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse566 (select (select .cse570 .cse572) .cse573))) (let ((.cse567 (select (select .cse570 (select (select .cse571 .cse572) .cse573)) (+ .cse566 4)))) (or (= .cse566 .cse567) (not (= 0 (select .cse568 .cse569))) (= .cse567 0))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse591 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse589 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse592 (select (select .cse589 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse593 (+ (select (select .cse591 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse590 (select (select .cse589 .cse592) .cse593))) (let ((.cse581 (select .cse591 .cse590)) (.cse582 (+ (select (select .cse591 .cse592) .cse593) 4))) (let ((.cse586 (store .cse591 .cse590 (store .cse581 .cse582 0))) (.cse583 (store .cse589 .cse590 (store (select .cse589 .cse590) .cse582 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse587 (select (select .cse583 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse588 (+ (select (select .cse586 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse579 (select (select .cse586 .cse587) .cse588))) (let ((.cse584 (select (select .cse583 .cse587) .cse588)) (.cse585 (+ .cse579 4))) (let ((.cse580 (select (select .cse586 .cse584) .cse585))) (or (= .cse579 .cse580) (not (= 0 (select .cse581 .cse582))) (= (select (select .cse583 .cse584) .cse585) .cse584) (= .cse580 0)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse606 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse605 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse607 (select (select .cse605 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse608 (+ (select (select .cse606 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse595 (select (select .cse605 .cse607) .cse608))) (let ((.cse600 (select .cse606 .cse595)) (.cse601 (+ (select (select .cse606 .cse607) .cse608) 4))) (let ((.cse597 (store .cse606 .cse595 (store .cse600 .cse601 0))) (.cse602 (store .cse605 .cse595 (store (select .cse605 .cse595) .cse601 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse603 (select (select .cse602 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse604 (+ (select (select .cse597 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse596 (select (select .cse597 .cse603) .cse604))) (let ((.cse598 (select (select .cse602 .cse603) .cse604)) (.cse599 (+ .cse596 4))) (let ((.cse594 (select (select .cse602 .cse598) .cse599))) (or (not (= .cse594 .cse595)) (= .cse596 (select (select .cse597 .cse598) .cse599)) (not (= 0 (select .cse600 .cse601))) (= .cse594 .cse598)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse621 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse619 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse622 (select (select .cse619 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse623 (+ (select (select .cse621 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse620 (select (select .cse619 .cse622) .cse623))) (let ((.cse613 (select .cse621 .cse620)) (.cse614 (+ (select (select .cse621 .cse622) .cse623) 4))) (let ((.cse610 (store .cse621 .cse620 (store .cse613 .cse614 0))) (.cse616 (store .cse619 .cse620 (store (select .cse619 .cse620) .cse614 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse617 (select (select .cse616 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse618 (+ (select (select .cse610 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse609 (select (select .cse610 .cse617) .cse618))) (let ((.cse611 (select (select .cse616 .cse617) .cse618)) (.cse612 (+ .cse609 4))) (let ((.cse615 (select (select .cse616 .cse611) .cse612))) (or (= .cse609 (select (select .cse610 .cse611) .cse612)) (not (= 0 (select .cse613 .cse614))) (= .cse615 .cse611) (= .cse615 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse635 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse633 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse636 (select (select .cse633 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse637 (+ (select (select .cse635 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse634 (select (select .cse633 .cse636) .cse637))) (let ((.cse628 (select .cse635 .cse634)) (.cse629 (+ (select (select .cse635 .cse636) .cse637) 4))) (let ((.cse625 (store .cse635 .cse634 (store .cse628 .cse629 0))) (.cse630 (store .cse633 .cse634 (store (select .cse633 .cse634) .cse629 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse631 (select (select .cse630 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse632 (+ (select (select .cse625 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse624 (select (select .cse625 .cse631) .cse632))) (let ((.cse626 (select (select .cse630 .cse631) .cse632)) (.cse627 (+ .cse624 4))) (or (= .cse624 (select (select .cse625 .cse626) .cse627)) (not (= 0 (select .cse628 .cse629))) (= (select (select .cse630 .cse626) .cse627) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse649 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse648 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse650 (select (select .cse648 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse651 (+ (select (select .cse649 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse641 (select (select .cse648 .cse650) .cse651))) (let ((.cse644 (select .cse649 .cse641)) (.cse645 (+ (select (select .cse649 .cse650) .cse651) 4))) (let ((.cse643 (store .cse649 .cse641 (store .cse644 .cse645 0))) (.cse638 (store .cse648 .cse641 (store (select .cse648 .cse641) .cse645 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse646 (select (select .cse638 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse647 (+ (select (select .cse643 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse642 (select (select .cse643 .cse646) .cse647))) (let ((.cse639 (select (select .cse638 .cse646) .cse647)) (.cse640 (+ .cse642 4))) (or (not (= (select (select .cse638 .cse639) .cse640) .cse641)) (= .cse642 (select (select .cse643 .cse639) .cse640)) (not (= 0 (select .cse644 .cse645))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))) .cse360) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse663 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse662 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse664 (select (select .cse662 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse665 (+ (select (select .cse663 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse655 (select (select .cse662 .cse664) .cse665))) (let ((.cse656 (select .cse663 .cse655)) (.cse657 (+ (select (select .cse663 .cse664) .cse665) 4))) (let ((.cse658 (store .cse663 .cse655 (store .cse656 .cse657 0))) (.cse652 (store .cse662 .cse655 (store (select .cse662 .cse655) .cse657 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse660 (select (select .cse652 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse661 (+ (select (select .cse658 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse659 (select (select .cse658 .cse660) .cse661))) (let ((.cse654 (+ .cse659 4)) (.cse653 (select (select .cse652 .cse660) .cse661))) (or (not (= (select (select .cse652 .cse653) .cse654) .cse655)) (= .cse653 .cse655) (not (= 0 (select .cse656 .cse657))) (= (select (select .cse658 .cse653) .cse654) .cse659) (= .cse653 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse678 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse676 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse679 (select (select .cse676 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse680 (+ (select (select .cse678 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse677 (select (select .cse676 .cse679) .cse680))) (let ((.cse668 (select .cse678 .cse677)) (.cse669 (+ (select (select .cse678 .cse679) .cse680) 4))) (let ((.cse673 (store .cse678 .cse677 (store .cse668 .cse669 0))) (.cse670 (store .cse676 .cse677 (store (select .cse676 .cse677) .cse669 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse674 (select (select .cse670 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse675 (+ (select (select .cse673 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse666 (select (select .cse673 .cse674) .cse675))) (let ((.cse671 (select (select .cse670 .cse674) .cse675)) (.cse672 (+ .cse666 4))) (let ((.cse667 (select (select .cse673 .cse671) .cse672))) (or (= .cse666 0) (= .cse666 .cse667) (not (= 0 (select .cse668 .cse669))) (= (select (select .cse670 .cse671) .cse672) .cse671) (= .cse667 0)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or .cse417 (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse691 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse690 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse692 (select (select .cse690 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse693 (+ (select (select .cse691 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse683 (select (select .cse690 .cse692) .cse693))) (let ((.cse684 (select .cse691 .cse683)) (.cse685 (+ (select (select .cse691 .cse692) .cse693) 4))) (let ((.cse689 (store .cse691 .cse683 (store .cse684 .cse685 0))) (.cse686 (store .cse690 .cse683 (store (select .cse690 .cse683) .cse685 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse687 (select (select .cse686 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse688 (+ (select (select .cse689 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse681 (select (select .cse689 .cse687) .cse688)) (.cse682 (select (select .cse686 .cse687) .cse688))) (or (= .cse681 0) (= .cse682 .cse683) (not (= 0 (select .cse684 .cse685))) (= (select (select .cse686 .cse682) (+ .cse681 4)) .cse682)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse704 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse703 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse705 (select (select .cse703 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse706 (+ (select (select .cse704 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse696 (select (select .cse703 .cse705) .cse706))) (let ((.cse697 (select .cse704 .cse696)) (.cse698 (+ (select (select .cse704 .cse705) .cse706) 4))) (let ((.cse699 (store .cse704 .cse696 (store .cse697 .cse698 0))) (.cse702 (store .cse703 .cse696 (store (select .cse703 .cse696) .cse698 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse700 (select (select .cse702 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse701 (+ (select (select .cse699 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse695 (select (select .cse702 .cse700) .cse701)) (.cse694 (select (select .cse699 .cse700) .cse701))) (or (= .cse694 0) (= .cse695 .cse696) (not (= 0 (select .cse697 .cse698))) (= (select (select .cse699 .cse695) (+ .cse694 4)) .cse694)))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse718 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse717 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse719 (select (select .cse717 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse720 (+ (select (select .cse718 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse712 (select (select .cse717 .cse719) .cse720))) (let ((.cse709 (select .cse718 .cse712)) (.cse710 (+ (select (select .cse718 .cse719) .cse720) 4))) (let ((.cse713 (store .cse718 .cse712 (store .cse709 .cse710 0))) (.cse716 (store .cse717 .cse712 (store (select .cse717 .cse712) .cse710 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse714 (select (select .cse716 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse715 (+ (select (select .cse713 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse711 (select (select .cse716 .cse714) .cse715)) (.cse707 (select (select .cse713 .cse714) .cse715))) (let ((.cse708 (select (select .cse713 .cse711) (+ .cse707 4)))) (or (= .cse707 .cse708) (not (= 0 (select .cse709 .cse710))) (= .cse708 0) (not (= .cse711 .cse712)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse732 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse731 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse733 (select (select .cse731 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse734 (+ (select (select .cse732 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse724 (select (select .cse731 .cse733) .cse734))) (let ((.cse726 (select .cse732 .cse724)) (.cse727 (+ (select (select .cse732 .cse733) .cse734) 4))) (let ((.cse728 (store .cse732 .cse724 (store .cse726 .cse727 0))) (.cse721 (store .cse731 .cse724 (store (select .cse731 .cse724) .cse727 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse729 (select (select .cse721 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse730 (+ (select (select .cse728 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse725 (select (select .cse728 .cse729) .cse730))) (let ((.cse722 (select (select .cse721 .cse729) .cse730)) (.cse723 (+ .cse725 4))) (or (not (= (select (select .cse721 .cse722) .cse723) .cse724)) (= .cse725 0) (= .cse722 .cse724) (not (= 0 (select .cse726 .cse727))) (= (select (select .cse728 .cse722) .cse723) .cse725))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse745 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse743 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse746 (select (select .cse743 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse747 (+ (select (select .cse745 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse744 (select (select .cse743 .cse746) .cse747))) (let ((.cse737 (select .cse745 .cse744)) (.cse738 (+ (select (select .cse745 .cse746) .cse747) 4))) (let ((.cse739 (store .cse745 .cse744 (store .cse737 .cse738 0))) (.cse740 (store .cse743 .cse744 (store (select .cse743 .cse744) .cse738 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse741 (select (select .cse740 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse742 (+ (select (select .cse739 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse735 (select (select .cse739 .cse741) .cse742))) (let ((.cse736 (select (select .cse739 (select (select .cse740 .cse741) .cse742)) (+ .cse735 4)))) (or (= .cse735 0) (= .cse735 .cse736) (not (= 0 (select .cse737 .cse738))) (= .cse736 0))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (or .cse417 (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse758 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse757 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse759 (select (select .cse757 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse760 (+ (select (select .cse758 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse749 (select (select .cse757 .cse759) .cse760))) (let ((.cse750 (select .cse758 .cse749)) (.cse751 (+ (select (select .cse758 .cse759) .cse760) 4))) (let ((.cse752 (store .cse758 .cse749 (store .cse750 .cse751 0))) (.cse756 (store .cse757 .cse749 (store (select .cse757 .cse749) .cse751 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse754 (select (select .cse756 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse755 (+ (select (select .cse752 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse748 (select (select .cse756 .cse754) .cse755))) (or (= .cse748 .cse749) (not (= 0 (select .cse750 .cse751))) (let ((.cse753 (select (select .cse752 .cse754) .cse755))) (= (select (select .cse752 .cse748) (+ .cse753 4)) .cse753)) (= .cse748 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse770 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse769 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse771 (select (select .cse769 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse772 (+ (select (select .cse770 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse762 (select (select .cse769 .cse771) .cse772))) (let ((.cse763 (select .cse770 .cse762)) (.cse764 (+ (select (select .cse770 .cse771) .cse772) 4))) (let ((.cse766 (store .cse770 .cse762 (store .cse763 .cse764 0))) (.cse765 (store .cse769 .cse762 (store (select .cse769 .cse762) .cse764 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse767 (select (select .cse765 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse768 (+ (select (select .cse766 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse761 (select (select .cse765 .cse767) .cse768))) (or (= .cse761 .cse762) (not (= 0 (select .cse763 .cse764))) (= (select (select .cse765 .cse761) (+ (select (select .cse766 .cse767) .cse768) 4)) .cse761) (= .cse761 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))) (or .cse417 (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse784 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse783 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse785 (select (select .cse783 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse786 (+ (select (select .cse784 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse780 (select (select .cse783 .cse785) .cse786))) (let ((.cse777 (select .cse784 .cse780)) (.cse778 (+ (select (select .cse784 .cse785) .cse786) 4))) (let ((.cse774 (store .cse784 .cse780 (store .cse777 .cse778 0))) (.cse779 (store .cse783 .cse780 (store (select .cse783 .cse780) .cse778 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse781 (select (select .cse779 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse782 (+ (select (select .cse774 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse773 (select (select .cse774 .cse781) .cse782))) (let ((.cse776 (+ .cse773 4)) (.cse775 (select (select .cse779 .cse781) .cse782))) (or (= .cse773 (select (select .cse774 .cse775) .cse776)) (not (= 0 (select .cse777 .cse778))) (= (select (select .cse779 .cse775) .cse776) .cse775) (not (= .cse775 .cse780)))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| Int)) (or (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse797 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1764)) (.cse796 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| v_ArrVal_1763))) (let ((.cse798 (select (select .cse796 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse799 (+ (select (select .cse797 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse794 (select (select .cse796 .cse798) .cse799))) (let ((.cse792 (select .cse797 .cse794)) (.cse793 (+ (select (select .cse797 .cse798) .cse799) 4))) (let ((.cse788 (store .cse797 .cse794 (store .cse792 .cse793 0))) (.cse795 (store .cse796 .cse794 (store (select .cse796 .cse794) .cse793 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|)))) (let ((.cse790 (select (select .cse795 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse791 (+ (select (select .cse788 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse789 (select (select .cse795 .cse790) .cse791))) (or (let ((.cse787 (select (select .cse788 .cse790) .cse791))) (= .cse787 (select (select .cse788 .cse789) (+ .cse787 4)))) (not (= 0 (select .cse792 .cse793))) (not (= .cse789 .cse794))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_28|))))))))) is different from true [2023-02-16 01:09:46,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971801549] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:46,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:09:46,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 51 [2023-02-16 01:09:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140860354] [2023-02-16 01:09:46,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:09:46,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-16 01:09:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:09:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-16 01:09:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1786, Unknown=40, NotChecked=2060, Total=4032 [2023-02-16 01:09:46,459 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 51 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 42 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:09:46,899 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= 1 .cse0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse2) (= .cse0 1))) is different from false [2023-02-16 01:09:46,902 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= 1 .cse0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse2) (= .cse0 1))) is different from true [2023-02-16 01:09:46,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse6 .cse5)) (.cse0 (select .cse6 4)) (.cse4 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse4) (= (select .cse3 .cse5) 0)))) is different from false [2023-02-16 01:09:46,907 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse6 .cse5)) (.cse0 (select .cse6 4)) (.cse4 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse4) (= (select .cse3 .cse5) 0)))) is different from true [2023-02-16 01:09:46,911 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse6 .cse5)) (.cse0 (select .cse6 4)) (.cse4 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 4) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse4) (= (select .cse3 .cse5) 0)))) is different from false [2023-02-16 01:09:46,913 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse6 .cse5)) (.cse0 (select .cse6 4)) (.cse4 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1))) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 4) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse4) (= (select .cse3 .cse5) 0)))) is different from true [2023-02-16 01:09:46,916 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (not (= .cse2 |c_ULTIMATE.start_sll_create_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= 1 .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= 1 (select |c_#valid| .cse2)))) is different from false [2023-02-16 01:09:46,918 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (not (= .cse2 |c_ULTIMATE.start_sll_create_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= 1 .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= 1 (select |c_#valid| .cse2)))) is different from true [2023-02-16 01:09:46,922 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#valid| .cse3)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse1) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0) (not (= .cse0 .cse3))))) is different from false [2023-02-16 01:09:46,924 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#valid| .cse3)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~data#1| |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= 1 (select |c_#valid| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |c_#valid| .cse2))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse1) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0) (not (= .cse0 .cse3))))) is different from true [2023-02-16 01:09:46,928 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_int| |c_old(#memory_int)|)) is different from false [2023-02-16 01:09:46,929 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_int| |c_old(#memory_int)|)) is different from true [2023-02-16 01:09:46,932 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= 0 .cse0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_~data#1| |c_node_create_#in~data#1|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= .cse1 1) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1) |c_#valid|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1))) (= .cse0 0) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from false [2023-02-16 01:09:46,934 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= 0 .cse0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_~data#1| |c_node_create_#in~data#1|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= .cse1 1) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1) |c_#valid|) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1))) (= .cse0 0) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-16 01:09:46,944 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse3 (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse4 (select |c_old(#valid)| |c_node_create_#res#1.base|))) (and (or .cse0 (= (select |c_old(#valid)| .cse1) 0)) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_node_create_#res#1.offset| 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 0) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1751 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1751))) (= (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)) |c_#memory_$Pointer$.base|) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or .cse0 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (= (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1)) |c_#memory_$Pointer$.offset|) (or .cse3 (= |c_node_create_#res#1.base| .cse2)) (exists ((v_ArrVal_1749 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1749))) (= 0 .cse4) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) .cse3) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|))) (= .cse4 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6))) |c_#valid|))) is different from false [2023-02-16 01:09:46,949 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse3 (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse4 (select |c_old(#valid)| |c_node_create_#res#1.base|))) (and (or .cse0 (= (select |c_old(#valid)| .cse1) 0)) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_node_create_#res#1.offset| 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 0) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1751 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1751))) (= (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)) |c_#memory_$Pointer$.base|) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or .cse0 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (= (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1)) |c_#memory_$Pointer$.offset|) (or .cse3 (= |c_node_create_#res#1.base| .cse2)) (exists ((v_ArrVal_1749 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1749))) (= 0 .cse4) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) .cse3) (exists ((v_arrayElimIndex_53 Int) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_53) 0) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_198) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|))) (= .cse4 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6))) |c_#valid|))) is different from true [2023-02-16 01:09:46,958 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |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_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_append_~head#1.offset|) (not (= .cse1 .cse0)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)))) is different from false [2023-02-16 01:09:46,962 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |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_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_append_~head#1.offset|) (not (= .cse1 .cse0)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)))) is different from true [2023-02-16 01:09:46,971 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse1 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse2)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_append_~head#1.offset|) (not (= .cse2 .cse0)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1))) (<= (+ .cse6 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)))) is different from false [2023-02-16 01:09:46,975 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse1 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| .cse2)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_append_~head#1.offset|) (not (= .cse2 .cse0)) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1))) (<= (+ .cse6 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)))) is different from true [2023-02-16 01:09:46,984 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 ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (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)))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse5 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse5) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (not (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)))) is different from false [2023-02-16 01:09:46,987 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 ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (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)))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse5 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse5) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (not (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0)))) is different from true [2023-02-16 01:09:46,998 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 4) 0))))) is different from false [2023-02-16 01:09:47,001 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 4) 0))))) is different from true [2023-02-16 01:09:47,012 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (= (select .cse7 4) 0))))) is different from false [2023-02-16 01:09:47,016 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (= (select .cse7 4) 0))))) is different from true [2023-02-16 01:09:47,023 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 4) 0))))) is different from false [2023-02-16 01:09:47,026 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse3 (select .cse5 4)) (.cse6 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1))) (and (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse6)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 4) 0))))) is different from true [2023-02-16 01:09:47,036 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse11 (+ .cse2 4))) (let ((.cse8 (select .cse9 .cse11)) (.cse10 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse3 (select .cse10 .cse11)) (.cse4 (+ .cse8 4))) (let ((.cse0 (select .cse10 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (= .cse2 0) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse5)) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_30| .cse7))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 0))) (= .cse8 0) (or (= (select (select |c_#memory_int| .cse5) 0) |c_ULTIMATE.start_main_~data~0#1|) (= .cse5 .cse3)) (= (select .cse9 4) 0) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from false [2023-02-16 01:09:47,040 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse11 (+ .cse2 4))) (let ((.cse8 (select .cse9 .cse11)) (.cse10 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse3 (select .cse10 .cse11)) (.cse4 (+ .cse8 4))) (let ((.cse0 (select .cse10 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (<= (+ v_arrayElimCell_198 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0))) (= .cse2 0) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse5)) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_30| .cse7))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 0))) (= .cse8 0) (or (= (select (select |c_#memory_int| .cse5) 0) |c_ULTIMATE.start_main_~data~0#1|) (= .cse5 .cse3)) (= (select .cse9 4) 0) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from true [2023-02-16 01:09:47,060 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10))) (and (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (+ .cse6 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse3 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (<= (+ .cse2 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse8) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse6) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8)))))))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10) 0)))) is different from false [2023-02-16 01:09:47,064 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10))) (and (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (+ .cse6 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse3 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (<= (+ .cse2 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse8) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse6) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8)))))))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10) 0)))) is different from true [2023-02-16 01:09:47,076 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse3 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse3) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0)))))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:09:47,079 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ .cse6 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (+ .cse3 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| .cse3) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse7) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0)))))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) 0) |c_ULTIMATE.start_main_~data~0#1|)) is different from true [2023-02-16 01:09:47,100 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (+ .cse6 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse3 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (<= (+ .cse2 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse8) 1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse7)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0))) is different from false [2023-02-16 01:09:47,104 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (+ .cse6 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse3 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (<= (+ .cse4 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse4)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= .cse6 0) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (<= (+ .cse2 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse8) 1) (= (select (select |c_#memory_int| .cse4) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse7)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0))) is different from true [2023-02-16 01:09:47,131 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0)))) (= (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-02-16 01:09:47,133 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 0) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= 0 (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| v_arrayElimIndex_62) 0)))) (= (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|))) is different from true [2023-02-16 01:09:47,171 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= 1 .cse0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse2) (= .cse0 1))) is different from false [2023-02-16 01:09:47,173 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= 1 .cse0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_28| |c_#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 .cse2) (= .cse0 1))) is different from true [2023-02-16 01:09:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:09:47,177 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2023-02-16 01:09:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-16 01:09:47,177 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 42 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2023-02-16 01:09:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:09:47,178 INFO L225 Difference]: With dead ends: 71 [2023-02-16 01:09:47,178 INFO L226 Difference]: Without dead ends: 69 [2023-02-16 01:09:47,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=216, Invalid=2216, Unknown=80, NotChecked=5320, Total=7832 [2023-02-16 01:09:47,186 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:09:47,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 301 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 331 Invalid, 0 Unknown, 481 Unchecked, 0.2s Time] [2023-02-16 01:09:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-16 01:09:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-16 01:09:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:09:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2023-02-16 01:09:47,208 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 44 [2023-02-16 01:09:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:09:47,208 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2023-02-16 01:09:47,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 42 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:09:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2023-02-16 01:09:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 01:09:47,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:09:47,208 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-16 01:09:47,217 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-16 01:09:47,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-16 01:09:47,415 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:09:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:09:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash -820140493, now seen corresponding path program 3 times [2023-02-16 01:09:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:09:47,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525777424] [2023-02-16 01:09:47,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:09:47,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:09:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:48,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:09:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:09:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:09:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:09:48,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:09:48,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525777424] [2023-02-16 01:09:48,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525777424] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709538304] [2023-02-16 01:09:48,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 01:09:48,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:48,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:09:48,756 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-16 01:09:48,774 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-16 01:09:48,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 01:09:48,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:09:48,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-16 01:09:48,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:09:49,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:09:49,075 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-16 01:09:49,168 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-16 01:09:49,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:49,181 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-16 01:09:49,382 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 01:09:49,383 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 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 01:09:49,388 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-16 01:09:49,400 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 01:09:49,400 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 01:09:49,405 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-16 01:09:49,421 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:09:49,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2023-02-16 01:09:49,491 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-16 01:09:49,497 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 21 treesize of output 20 [2023-02-16 01:09:49,503 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 20 treesize of output 22 [2023-02-16 01:09:49,759 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-02-16 01:09:49,759 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 136 treesize of output 52 [2023-02-16 01:09:49,770 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-16 01:09:49,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2023-02-16 01:09:49,775 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:09:49,778 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-16 01:09:49,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:49,989 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-16 01:09:49,990 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 142 treesize of output 124 [2023-02-16 01:09:49,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:49,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:50,001 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:09:50,001 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 125 treesize of output 120 [2023-02-16 01:09:50,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:50,009 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 28 treesize of output 30 [2023-02-16 01:09:50,023 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-16 01:09:50,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 34 treesize of output 36 [2023-02-16 01:09:50,663 INFO L321 Elim1Store]: treesize reduction 239, result has 14.9 percent of original size [2023-02-16 01:09:50,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 396 treesize of output 141 [2023-02-16 01:09:50,685 INFO L321 Elim1Store]: treesize reduction 116, result has 14.1 percent of original size [2023-02-16 01:09:50,686 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 325 treesize of output 175 [2023-02-16 01:09:50,696 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 46 treesize of output 48 [2023-02-16 01:09:51,126 INFO L321 Elim1Store]: treesize reduction 72, result has 72.0 percent of original size [2023-02-16 01:09:51,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 337 treesize of output 321 [2023-02-16 01:09:51,345 INFO L321 Elim1Store]: treesize reduction 64, result has 76.6 percent of original size [2023-02-16 01:09:51,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 299 treesize of output 431 [2023-02-16 01:10:58,495 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-16 01:10:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:58,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:10:58,733 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1937 Int) (v_ArrVal_1938 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse3 (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|) .cse4 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse4 v_ArrVal_1937)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1938) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2023-02-16 01:11:00,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709538304] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:00,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:11:00,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29] total 48 [2023-02-16 01:11:00,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195389462] [2023-02-16 01:11:00,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:11:00,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-16 01:11:00,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:00,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-16 01:11:00,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3372, Unknown=3, NotChecked=116, Total=3660 [2023-02-16 01:11:00,683 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 48 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 40 states have internal predecessors, (73), 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-16 01:11:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:04,102 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2023-02-16 01:11:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 01:11:04,102 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 40 states have internal predecessors, (73), 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 44 [2023-02-16 01:11:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:04,104 INFO L225 Difference]: With dead ends: 84 [2023-02-16 01:11:04,104 INFO L226 Difference]: Without dead ends: 66 [2023-02-16 01:11:04,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=360, Invalid=5191, Unknown=3, NotChecked=146, Total=5700 [2023-02-16 01:11:04,105 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 61 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:04,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 457 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 01:11:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-16 01:11:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2023-02-16 01:11:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:11:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-02-16 01:11:04,139 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 44 [2023-02-16 01:11:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:04,139 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-02-16 01:11:04,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 40 states have internal predecessors, (73), 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-16 01:11:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-02-16 01:11:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 01:11:04,140 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:04,140 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:04,147 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-16 01:11:04,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-16 01:11:04,347 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:04,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1518413252, now seen corresponding path program 3 times [2023-02-16 01:11:04,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:04,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229410936] [2023-02-16 01:11:04,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:04,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:04,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:11:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:04,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:11:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:04,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:11:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-16 01:11:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:04,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229410936] [2023-02-16 01:11:04,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229410936] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:04,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210018522] [2023-02-16 01:11:04,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 01:11:04,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:04,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:11:04,492 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-16 01:11:04,494 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-16 01:11:04,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-16 01:11:04,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:11:04,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 01:11:04,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:11:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-16 01:11:04,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:11:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-16 01:11:04,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210018522] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:11:04,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:11:04,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-02-16 01:11:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686081933] [2023-02-16 01:11:04,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:11:04,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 01:11:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 01:11:04,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-16 01:11:04,927 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 01:11:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:05,000 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-02-16 01:11:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 01:11:05,001 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2023-02-16 01:11:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:05,001 INFO L225 Difference]: With dead ends: 80 [2023-02-16 01:11:05,001 INFO L226 Difference]: Without dead ends: 77 [2023-02-16 01:11:05,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-16 01:11:05,005 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 27 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:05,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 207 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:11:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-16 01:11:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2023-02-16 01:11:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:11:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2023-02-16 01:11:05,027 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 46 [2023-02-16 01:11:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:05,028 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2023-02-16 01:11:05,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 01:11:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2023-02-16 01:11:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 01:11:05,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:05,030 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:05,036 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-16 01:11:05,237 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,SelfDestructingSolverStorable14 [2023-02-16 01:11:05,237 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:05,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1518414926, now seen corresponding path program 4 times [2023-02-16 01:11:05,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:05,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3122581] [2023-02-16 01:11:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:06,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:11:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:06,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:11:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 01:11:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:11:06,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:06,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3122581] [2023-02-16 01:11:06,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3122581] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:06,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995860455] [2023-02-16 01:11:06,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 01:11:06,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:06,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:11:06,933 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-16 01:11:06,935 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-16 01:11:07,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 01:11:07,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:11:07,127 WARN L261 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 198 conjunts are in the unsatisfiable core [2023-02-16 01:11:07,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:11:07,187 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-16 01:11:07,333 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-16 01:11:07,343 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-16 01:11:07,432 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-16 01:11:07,435 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-16 01:11:07,438 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-16 01:11:07,669 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:11:07,669 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-16 01:11:07,679 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-16 01:11:07,688 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-16 01:11:07,769 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-16 01:11:07,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-16 01:11:08,151 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:11:08,151 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 44 [2023-02-16 01:11:08,155 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-16 01:11:08,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:08,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:08,160 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 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-16 01:11:08,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:08,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:08,306 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-16 01:11:08,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 83 [2023-02-16 01:11:08,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:08,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:08,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:08,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:08,328 INFO L321 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2023-02-16 01:11:08,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 57 [2023-02-16 01:11:08,359 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:11:08,359 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-16 01:11:09,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,122 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:09,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,154 INFO L321 Elim1Store]: treesize reduction 192, result has 13.9 percent of original size [2023-02-16 01:11:09,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 209 treesize of output 127 [2023-02-16 01:11:09,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,189 INFO L321 Elim1Store]: treesize reduction 215, result has 14.7 percent of original size [2023-02-16 01:11:09,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 13 case distinctions, treesize of input 329 treesize of output 211 [2023-02-16 01:11:09,933 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:09,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,962 INFO L321 Elim1Store]: treesize reduction 204, result has 6.4 percent of original size [2023-02-16 01:11:09,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 15 new quantified variables, introduced 21 case distinctions, treesize of input 462 treesize of output 195 [2023-02-16 01:11:09,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,979 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2023-02-16 01:11:09,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 61 [2023-02-16 01:11:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:11:10,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:11:10,475 INFO L321 Elim1Store]: treesize reduction 4, result has 95.8 percent of original size [2023-02-16 01:11:10,476 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 100 treesize of output 99 [2023-02-16 01:11:18,551 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse0 (select (select .cse16 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse0) (forall ((v_ArrVal_2277 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse17 (select (select .cse14 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse18 (+ .cse0 4))) (let ((.cse15 (select (select .cse14 .cse17) .cse18))) (let ((.cse9 (select .cse16 .cse15)) (.cse8 (+ (select (select .cse16 .cse17) .cse18) 4))) (let ((.cse7 (select .cse14 .cse15)) (.cse5 (store .cse16 .cse15 (store .cse9 .cse8 0)))) (let ((.cse10 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (store .cse14 .cse15 (store .cse7 .cse8 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse10 4))) (let ((.cse11 (select (select .cse1 .cse4) .cse13)) (.cse12 (+ (select (select .cse5 .cse4) .cse13) 4))) (let ((.cse6 (select (select .cse5 .cse11) .cse12))) (let ((.cse2 (select (select .cse1 .cse11) .cse12)) (.cse3 (+ .cse6 4))) (or (= (select (select .cse1 .cse2) .cse3) .cse4) (= (select (select .cse5 .cse2) .cse3) 0) (= .cse6 0) (not (= 0 (select .cse7 .cse8))) (not (= (select .cse9 .cse8) 0)) (= .cse10 0))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2277 Int)) (let ((.cse30 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse33 (select (select .cse30 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse34 (+ (select (select .cse32 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse31 (select (select .cse30 .cse33) .cse34))) (let ((.cse21 (select .cse30 .cse31)) (.cse23 (select .cse32 .cse31)) (.cse22 (+ (select (select .cse32 .cse33) .cse34) 4))) (let ((.cse26 (store .cse32 .cse31 (store .cse23 .cse22 0))) (.cse25 (store .cse30 .cse31 (store .cse21 .cse22 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse29 (+ (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse27 (select (select .cse25 .cse20) .cse29)) (.cse28 (+ (select (select .cse26 .cse20) .cse29) 4))) (let ((.cse24 (select (select .cse25 .cse27) .cse28))) (let ((.cse19 (select (select .cse25 .cse24) (+ (select (select .cse26 .cse27) .cse28) 4)))) (or (= .cse19 .cse20) (= .cse20 0) (not (= 0 (select .cse21 .cse22))) (not (= (select .cse23 .cse22) 0)) (= .cse24 0) (= .cse19 0)))))))))))) (= 0 .cse33))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse50 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse35 (select (select .cse50 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse35) (forall ((v_ArrVal_2277 Int)) (let ((.cse48 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse51 (select (select .cse48 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse52 (+ .cse35 4))) (let ((.cse49 (select (select .cse48 .cse51) .cse52))) (let ((.cse41 (select .cse50 .cse49)) (.cse40 (+ (select (select .cse50 .cse51) .cse52) 4))) (let ((.cse39 (select .cse48 .cse49)) (.cse46 (store .cse50 .cse49 (store .cse41 .cse40 0)))) (let ((.cse42 (select (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse43 (store .cse48 .cse49 (store .cse39 .cse40 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse37 (select (select .cse43 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse47 (+ .cse42 4))) (let ((.cse44 (select (select .cse43 .cse37) .cse47)) (.cse45 (+ (select (select .cse46 .cse37) .cse47) 4))) (let ((.cse38 (select (select .cse46 .cse44) .cse45))) (let ((.cse36 (select (select .cse43 (select (select .cse43 .cse44) .cse45)) (+ .cse38 4)))) (or (= .cse36 .cse37) (= .cse38 0) (not (= 0 (select .cse39 .cse40))) (not (= (select .cse41 .cse40) 0)) (= .cse42 0) (= .cse36 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse65 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse53 (select (select .cse65 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse53) (forall ((v_ArrVal_2276 Int)) (let ((.cse67 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse68 (+ (select (select .cse67 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse66 (select (select .cse65 .cse53) .cse68))) (let ((.cse57 (select .cse65 .cse66)) (.cse59 (select .cse67 .cse66)) (.cse58 (+ (select (select .cse67 .cse53) .cse68) 4))) (let ((.cse63 (store .cse67 .cse66 (store .cse59 .cse58 0))) (.cse60 (store .cse65 .cse66 (store .cse57 .cse58 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse55 (select (select .cse60 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (+ (select (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse61 (select (select .cse60 .cse55) .cse64)) (.cse62 (+ (select (select .cse63 .cse55) .cse64) 4))) (let ((.cse56 (select (select .cse63 .cse61) .cse62))) (let ((.cse54 (select (select .cse60 (select (select .cse60 .cse61) .cse62)) (+ .cse56 4)))) (or (= .cse54 .cse55) (= .cse55 0) (= .cse56 0) (not (= 0 (select .cse57 .cse58))) (not (= (select .cse59 .cse58) 0)) (= .cse54 0)))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse82 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse69 (select (select .cse82 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse69) (forall ((v_ArrVal_2276 Int)) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse85 (+ (select (select .cse84 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse83 (select (select .cse82 .cse69) .cse85))) (let ((.cse75 (select .cse84 .cse83)) (.cse74 (+ (select (select .cse84 .cse69) .cse85) 4))) (let ((.cse73 (select .cse82 .cse83)) (.cse76 (store .cse84 .cse83 (store .cse75 .cse74 0)))) (let ((.cse71 (select (select .cse76 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse77 (store .cse82 .cse83 (store .cse73 .cse74 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse80 (select (select .cse77 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse81 (+ .cse71 4))) (let ((.cse78 (select (select .cse77 .cse80) .cse81)) (.cse79 (+ (select (select .cse76 .cse80) .cse81) 4))) (let ((.cse72 (select (select .cse76 .cse78) .cse79))) (let ((.cse70 (select (select .cse76 (select (select .cse77 .cse78) .cse79)) (+ .cse72 4)))) (or (= .cse70 .cse71) (= .cse70 0) (= .cse72 0) (not (= 0 (select .cse73 .cse74))) (not (= (select .cse75 .cse74) 0)) (= .cse71 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2277 Int)) (let ((.cse99 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse86 (select (select .cse99 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse86) (forall ((v_ArrVal_2276 Int)) (let ((.cse101 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse102 (+ (select (select .cse101 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse100 (select (select .cse99 .cse86) .cse102))) (let ((.cse92 (select .cse101 .cse100)) (.cse91 (+ (select (select .cse101 .cse86) .cse102) 4))) (let ((.cse90 (select .cse99 .cse100)) (.cse97 (store .cse101 .cse100 (store .cse92 .cse91 0)))) (let ((.cse93 (select (select .cse97 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse94 (store .cse99 .cse100 (store .cse90 .cse91 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse88 (select (select .cse94 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse98 (+ .cse93 4))) (let ((.cse95 (select (select .cse94 .cse88) .cse98)) (.cse96 (+ (select (select .cse97 .cse88) .cse98) 4))) (let ((.cse89 (select (select .cse97 .cse95) .cse96))) (let ((.cse87 (select (select .cse94 (select (select .cse94 .cse95) .cse96)) (+ .cse89 4)))) (or (= .cse87 .cse88) (= .cse89 0) (not (= 0 (select .cse90 .cse91))) (not (= (select .cse92 .cse91) 0)) (= .cse93 0) (= .cse87 0))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2276 Int)) (let ((.cse118 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse103 (select (select .cse118 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse103) (forall ((v_ArrVal_2277 Int)) (let ((.cse116 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse119 (select (select .cse116 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse120 (+ .cse103 4))) (let ((.cse117 (select (select .cse116 .cse119) .cse120))) (let ((.cse111 (select .cse118 .cse117)) (.cse110 (+ (select (select .cse118 .cse119) .cse120) 4))) (let ((.cse109 (select .cse116 .cse117)) (.cse108 (store .cse118 .cse117 (store .cse111 .cse110 0)))) (let ((.cse112 (select (select .cse108 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse104 (store .cse116 .cse117 (store .cse109 .cse110 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse107 (select (select .cse104 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse115 (+ .cse112 4))) (let ((.cse113 (select (select .cse104 .cse107) .cse115)) (.cse114 (+ (select (select .cse108 .cse107) .cse115) 4))) (let ((.cse106 (+ (select (select .cse108 .cse113) .cse114) 4)) (.cse105 (select (select .cse104 .cse113) .cse114))) (or (= (select (select .cse104 .cse105) .cse106) .cse107) (= (select (select .cse108 .cse105) .cse106) 0) (not (= 0 (select .cse109 .cse110))) (not (= (select .cse111 .cse110) 0)) (= .cse105 0) (= .cse112 0)))))))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse135 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse121 (select (select .cse135 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse121) (forall ((v_ArrVal_2277 Int)) (let ((.cse133 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse136 (select (select .cse133 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse137 (+ .cse121 4))) (let ((.cse134 (select (select .cse133 .cse136) .cse137))) (let ((.cse125 (select .cse133 .cse134)) (.cse127 (select .cse135 .cse134)) (.cse126 (+ (select (select .cse135 .cse136) .cse137) 4))) (let ((.cse131 (store .cse135 .cse134 (store .cse127 .cse126 0))) (.cse128 (store .cse133 .cse134 (store .cse125 .cse126 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse123 (select (select .cse128 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse132 (+ (select (select .cse131 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse129 (select (select .cse128 .cse123) .cse132)) (.cse130 (+ (select (select .cse131 .cse123) .cse132) 4))) (let ((.cse124 (select (select .cse131 .cse129) .cse130))) (let ((.cse122 (select (select .cse128 (select (select .cse128 .cse129) .cse130)) (+ .cse124 4)))) (or (= .cse122 .cse123) (= .cse123 0) (= .cse124 0) (not (= 0 (select .cse125 .cse126))) (not (= (select .cse127 .cse126) 0)) (= .cse122 0)))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse151 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse138 (select (select .cse151 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse138) (forall ((v_ArrVal_2276 Int)) (let ((.cse153 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse154 (+ (select (select .cse153 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse152 (select (select .cse151 .cse138) .cse154))) (let ((.cse143 (select .cse153 .cse152)) (.cse142 (+ (select (select .cse153 .cse138) .cse154) 4))) (let ((.cse141 (select .cse151 .cse152)) (.cse145 (store .cse153 .cse152 (store .cse143 .cse142 0)))) (let ((.cse140 (select (select .cse145 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse148 (store .cse151 .cse152 (store .cse141 .cse142 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse149 (select (select .cse148 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse150 (+ .cse140 4))) (let ((.cse146 (select (select .cse148 .cse149) .cse150)) (.cse147 (+ (select (select .cse145 .cse149) .cse150) 4))) (let ((.cse144 (select (select .cse148 .cse146) .cse147))) (let ((.cse139 (select (select .cse145 .cse144) (+ (select (select .cse145 .cse146) .cse147) 4)))) (or (= .cse139 .cse140) (= .cse139 0) (not (= 0 (select .cse141 .cse142))) (not (= (select .cse143 .cse142) 0)) (= .cse144 0) (= .cse140 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse169 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse155 (select (select .cse169 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse155) (forall ((v_ArrVal_2277 Int)) (let ((.cse167 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse170 (select (select .cse167 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse171 (+ .cse155 4))) (let ((.cse168 (select (select .cse167 .cse170) .cse171))) (let ((.cse161 (select .cse167 .cse168)) (.cse163 (select .cse169 .cse168)) (.cse162 (+ (select (select .cse169 .cse170) .cse171) 4))) (let ((.cse160 (store .cse169 .cse168 (store .cse163 .cse162 0))) (.cse156 (store .cse167 .cse168 (store .cse161 .cse162 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse159 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse166 (+ (select (select .cse160 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse164 (select (select .cse156 .cse159) .cse166)) (.cse165 (+ (select (select .cse160 .cse159) .cse166) 4))) (let ((.cse158 (+ (select (select .cse160 .cse164) .cse165) 4)) (.cse157 (select (select .cse156 .cse164) .cse165))) (or (= (select (select .cse156 .cse157) .cse158) .cse159) (= .cse159 0) (= (select (select .cse160 .cse157) .cse158) 0) (not (= 0 (select .cse161 .cse162))) (not (= (select .cse163 .cse162) 0)) (= .cse157 0))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2277 Int)) (let ((.cse185 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse188 (select (select .cse185 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse187 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse189 (+ (select (select .cse187 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse186 (select (select .cse185 .cse188) .cse189))) (let ((.cse179 (select .cse187 .cse186)) (.cse178 (+ (select (select .cse187 .cse188) .cse189) 4))) (let ((.cse177 (select .cse185 .cse186)) (.cse172 (store .cse187 .cse186 (store .cse179 .cse178 0)))) (let ((.cse175 (select (select .cse172 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse180 (store .cse185 .cse186 (store .cse177 .cse178 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse183 (select (select .cse180 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse184 (+ .cse175 4))) (let ((.cse181 (select (select .cse180 .cse183) .cse184)) (.cse182 (+ (select (select .cse172 .cse183) .cse184) 4))) (let ((.cse176 (select (select .cse172 .cse181) .cse182))) (let ((.cse173 (select (select .cse180 .cse181) .cse182)) (.cse174 (+ .cse176 4))) (or (= (select (select .cse172 .cse173) .cse174) .cse175) (= .cse176 0) (not (= 0 (select .cse177 .cse178))) (not (= (select .cse179 .cse178) 0)) (= .cse175 0) (= (select (select .cse180 .cse173) .cse174) 0))))))))))))) (= 0 .cse188))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse204 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse207 (select (select .cse204 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse202 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse205 (select (select .cse202 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse206 (+ .cse207 4))) (let ((.cse203 (select (select .cse202 .cse205) .cse206))) (let ((.cse196 (select .cse202 .cse203)) (.cse198 (select .cse204 .cse203)) (.cse197 (+ (select (select .cse204 .cse205) .cse206) 4))) (let ((.cse194 (store .cse204 .cse203 (store .cse198 .cse197 0))) (.cse190 (store .cse202 .cse203 (store .cse196 .cse197 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse193 (select (select .cse190 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse201 (+ (select (select .cse194 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse199 (select (select .cse190 .cse193) .cse201)) (.cse200 (+ (select (select .cse194 .cse193) .cse201) 4))) (let ((.cse195 (select (select .cse194 .cse199) .cse200))) (let ((.cse191 (select (select .cse190 .cse199) .cse200)) (.cse192 (+ .cse195 4))) (or (= (select (select .cse190 .cse191) .cse192) .cse193) (= .cse193 0) (= (select (select .cse194 .cse191) .cse192) 0) (= .cse195 0) (not (= 0 (select .cse196 .cse197))) (not (= (select .cse198 .cse197) 0))))))))))))) (= 0 .cse207))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse222 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse225 (select (select .cse222 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse220 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse223 (select (select .cse220 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse224 (+ .cse225 4))) (let ((.cse221 (select (select .cse220 .cse223) .cse224))) (let ((.cse213 (select .cse222 .cse221)) (.cse212 (+ (select (select .cse222 .cse223) .cse224) 4))) (let ((.cse211 (select .cse220 .cse221)) (.cse214 (store .cse222 .cse221 (store .cse213 .cse212 0)))) (let ((.cse209 (select (select .cse214 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse215 (store .cse220 .cse221 (store .cse211 .cse212 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse218 (select (select .cse215 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse219 (+ .cse209 4))) (let ((.cse216 (select (select .cse215 .cse218) .cse219)) (.cse217 (+ (select (select .cse214 .cse218) .cse219) 4))) (let ((.cse210 (select (select .cse214 .cse216) .cse217))) (let ((.cse208 (select (select .cse214 (select (select .cse215 .cse216) .cse217)) (+ .cse210 4)))) (or (= .cse208 .cse209) (= .cse208 0) (= .cse210 0) (not (= 0 (select .cse211 .cse212))) (not (= (select .cse213 .cse212) 0)) (= .cse209 0))))))))))))) (= 0 .cse225))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse241 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse244 (select (select .cse241 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse239 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse242 (select (select .cse239 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse243 (+ .cse244 4))) (let ((.cse240 (select (select .cse239 .cse242) .cse243))) (let ((.cse234 (select .cse241 .cse240)) (.cse233 (+ (select (select .cse241 .cse242) .cse243) 4))) (let ((.cse232 (select .cse239 .cse240)) (.cse227 (store .cse241 .cse240 (store .cse234 .cse233 0)))) (let ((.cse230 (select (select .cse227 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse235 (store .cse239 .cse240 (store .cse232 .cse233 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse226 (select (select .cse235 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse238 (+ .cse230 4))) (let ((.cse236 (select (select .cse235 .cse226) .cse238)) (.cse237 (+ (select (select .cse227 .cse226) .cse238) 4))) (let ((.cse231 (select (select .cse227 .cse236) .cse237))) (let ((.cse228 (select (select .cse235 .cse236) .cse237)) (.cse229 (+ .cse231 4))) (or (= .cse226 0) (= (select (select .cse227 .cse228) .cse229) .cse230) (= .cse231 0) (not (= 0 (select .cse232 .cse233))) (not (= (select .cse234 .cse233) 0)) (= (select (select .cse235 .cse228) .cse229) 0))))))))))))) (= 0 .cse244))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse260 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse245 (select (select .cse260 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse245) (forall ((v_ArrVal_2277 Int)) (let ((.cse258 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse261 (select (select .cse258 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse262 (+ .cse245 4))) (let ((.cse259 (select (select .cse258 .cse261) .cse262))) (let ((.cse252 (select .cse260 .cse259)) (.cse251 (+ (select (select .cse260 .cse261) .cse262) 4))) (let ((.cse250 (select .cse258 .cse259)) (.cse253 (store .cse260 .cse259 (store .cse252 .cse251 0)))) (let ((.cse248 (select (select .cse253 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse254 (store .cse258 .cse259 (store .cse250 .cse251 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse246 (select (select .cse254 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse257 (+ .cse248 4))) (let ((.cse255 (select (select .cse254 .cse246) .cse257)) (.cse256 (+ (select (select .cse253 .cse246) .cse257) 4))) (let ((.cse249 (select (select .cse253 .cse255) .cse256))) (let ((.cse247 (select (select .cse253 (select (select .cse254 .cse255) .cse256)) (+ .cse249 4)))) (or (= .cse246 0) (= .cse247 .cse248) (= .cse247 0) (= .cse249 0) (not (= 0 (select .cse250 .cse251))) (not (= (select .cse252 .cse251) 0)))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2277 Int)) (let ((.cse275 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse278 (select (select .cse275 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse277 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse279 (+ (select (select .cse277 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse276 (select (select .cse275 .cse278) .cse279))) (let ((.cse269 (select .cse277 .cse276)) (.cse268 (+ (select (select .cse277 .cse278) .cse279) 4))) (let ((.cse267 (select .cse275 .cse276)) (.cse270 (store .cse277 .cse276 (store .cse269 .cse268 0)))) (let ((.cse265 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse271 (store .cse275 .cse276 (store .cse267 .cse268 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse263 (select (select .cse271 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse274 (+ .cse265 4))) (let ((.cse272 (select (select .cse271 .cse263) .cse274)) (.cse273 (+ (select (select .cse270 .cse263) .cse274) 4))) (let ((.cse266 (select (select .cse270 .cse272) .cse273))) (let ((.cse264 (select (select .cse270 (select (select .cse271 .cse272) .cse273)) (+ .cse266 4)))) (or (= .cse263 0) (= .cse264 .cse265) (= .cse264 0) (= .cse266 0) (not (= 0 (select .cse267 .cse268))) (not (= (select .cse269 .cse268) 0)))))))))))))) (= 0 .cse278))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse295 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse280 (select (select .cse295 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse280) (forall ((v_ArrVal_2277 Int)) (let ((.cse293 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse296 (select (select .cse293 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse297 (+ .cse280 4))) (let ((.cse294 (select (select .cse293 .cse296) .cse297))) (let ((.cse285 (select .cse295 .cse294)) (.cse284 (+ (select (select .cse295 .cse296) .cse297) 4))) (let ((.cse283 (select .cse293 .cse294)) (.cse289 (store .cse295 .cse294 (store .cse285 .cse284 0)))) (let ((.cse287 (select (select .cse289 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse288 (store .cse293 .cse294 (store .cse283 .cse284 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse282 (select (select .cse288 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse292 (+ .cse287 4))) (let ((.cse290 (select (select .cse288 .cse282) .cse292)) (.cse291 (+ (select (select .cse289 .cse282) .cse292) 4))) (let ((.cse286 (select (select .cse288 .cse290) .cse291))) (let ((.cse281 (select (select .cse288 .cse286) (+ (select (select .cse289 .cse290) .cse291) 4)))) (or (= .cse281 .cse282) (not (= 0 (select .cse283 .cse284))) (not (= (select .cse285 .cse284) 0)) (= .cse286 0) (= .cse287 0) (= .cse281 0))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse312 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse298 (select (select .cse312 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse298) (forall ((v_ArrVal_2277 Int)) (let ((.cse310 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse313 (select (select .cse310 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse314 (+ .cse298 4))) (let ((.cse311 (select (select .cse310 .cse313) .cse314))) (let ((.cse301 (select .cse310 .cse311)) (.cse303 (select .cse312 .cse311)) (.cse302 (+ (select (select .cse312 .cse313) .cse314) 4))) (let ((.cse306 (store .cse312 .cse311 (store .cse303 .cse302 0))) (.cse305 (store .cse310 .cse311 (store .cse301 .cse302 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse300 (select (select .cse305 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse309 (+ (select (select .cse306 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse307 (select (select .cse305 .cse300) .cse309)) (.cse308 (+ (select (select .cse306 .cse300) .cse309) 4))) (let ((.cse304 (select (select .cse305 .cse307) .cse308))) (let ((.cse299 (select (select .cse305 .cse304) (+ (select (select .cse306 .cse307) .cse308) 4)))) (or (= .cse299 .cse300) (= .cse300 0) (not (= 0 (select .cse301 .cse302))) (not (= (select .cse303 .cse302) 0)) (= .cse304 0) (= .cse299 0)))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse328 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse315 (select (select .cse328 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse315) (forall ((v_ArrVal_2276 Int)) (let ((.cse330 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse331 (+ (select (select .cse330 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse329 (select (select .cse328 .cse315) .cse331))) (let ((.cse323 (select .cse330 .cse329)) (.cse322 (+ (select (select .cse330 .cse315) .cse331) 4))) (let ((.cse321 (select .cse328 .cse329)) (.cse317 (store .cse330 .cse329 (store .cse323 .cse322 0)))) (let ((.cse320 (select (select .cse317 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse324 (store .cse328 .cse329 (store .cse321 .cse322 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse316 (select (select .cse324 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse327 (+ .cse320 4))) (let ((.cse325 (select (select .cse324 .cse316) .cse327)) (.cse326 (+ (select (select .cse317 .cse316) .cse327) 4))) (let ((.cse318 (select (select .cse324 .cse325) .cse326)) (.cse319 (+ (select (select .cse317 .cse325) .cse326) 4))) (or (= .cse316 0) (= (select (select .cse317 .cse318) .cse319) .cse320) (not (= 0 (select .cse321 .cse322))) (not (= (select .cse323 .cse322) 0)) (= .cse318 0) (= (select (select .cse324 .cse318) .cse319) 0)))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse345 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse332 (select (select .cse345 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse332) (forall ((v_ArrVal_2276 Int)) (let ((.cse347 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse348 (+ (select (select .cse347 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse346 (select (select .cse345 .cse332) .cse348))) (let ((.cse340 (select .cse347 .cse346)) (.cse339 (+ (select (select .cse347 .cse332) .cse348) 4))) (let ((.cse338 (select .cse345 .cse346)) (.cse337 (store .cse347 .cse346 (store .cse340 .cse339 0)))) (let ((.cse341 (select (select .cse337 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse333 (store .cse345 .cse346 (store .cse338 .cse339 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse336 (select (select .cse333 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse344 (+ .cse341 4))) (let ((.cse342 (select (select .cse333 .cse336) .cse344)) (.cse343 (+ (select (select .cse337 .cse336) .cse344) 4))) (let ((.cse335 (+ (select (select .cse337 .cse342) .cse343) 4)) (.cse334 (select (select .cse333 .cse342) .cse343))) (or (= (select (select .cse333 .cse334) .cse335) .cse336) (= (select (select .cse337 .cse334) .cse335) 0) (not (= 0 (select .cse338 .cse339))) (not (= (select .cse340 .cse339) 0)) (= .cse334 0) (= .cse341 0)))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse364 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse349 (select (select .cse364 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse349) (forall ((v_ArrVal_2277 Int)) (let ((.cse362 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse365 (select (select .cse362 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse366 (+ .cse349 4))) (let ((.cse363 (select (select .cse362 .cse365) .cse366))) (let ((.cse355 (select .cse364 .cse363)) (.cse354 (+ (select (select .cse364 .cse365) .cse366) 4))) (let ((.cse353 (select .cse362 .cse363)) (.cse357 (store .cse364 .cse363 (store .cse355 .cse354 0)))) (let ((.cse352 (select (select .cse357 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse360 (store .cse362 .cse363 (store .cse353 .cse354 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse350 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse361 (+ .cse352 4))) (let ((.cse358 (select (select .cse360 .cse350) .cse361)) (.cse359 (+ (select (select .cse357 .cse350) .cse361) 4))) (let ((.cse356 (select (select .cse360 .cse358) .cse359))) (let ((.cse351 (select (select .cse357 .cse356) (+ (select (select .cse357 .cse358) .cse359) 4)))) (or (= .cse350 0) (= .cse351 .cse352) (= .cse351 0) (not (= 0 (select .cse353 .cse354))) (not (= (select .cse355 .cse354) 0)) (= .cse356 0))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse380 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse367 (select (select .cse380 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse367) (forall ((v_ArrVal_2276 Int)) (let ((.cse382 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse383 (+ (select (select .cse382 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse381 (select (select .cse380 .cse367) .cse383))) (let ((.cse372 (select .cse382 .cse381)) (.cse371 (+ (select (select .cse382 .cse367) .cse383) 4))) (let ((.cse370 (select .cse380 .cse381)) (.cse376 (store .cse382 .cse381 (store .cse372 .cse371 0)))) (let ((.cse374 (select (select .cse376 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse375 (store .cse380 .cse381 (store .cse370 .cse371 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse369 (select (select .cse375 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse379 (+ .cse374 4))) (let ((.cse377 (select (select .cse375 .cse369) .cse379)) (.cse378 (+ (select (select .cse376 .cse369) .cse379) 4))) (let ((.cse373 (select (select .cse375 .cse377) .cse378))) (let ((.cse368 (select (select .cse375 .cse373) (+ (select (select .cse376 .cse377) .cse378) 4)))) (or (= .cse368 .cse369) (not (= 0 (select .cse370 .cse371))) (not (= (select .cse372 .cse371) 0)) (= .cse373 0) (= .cse374 0) (= .cse368 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2277 Int)) (let ((.cse397 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse384 (select (select .cse397 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse384) (forall ((v_ArrVal_2276 Int)) (let ((.cse399 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse400 (+ (select (select .cse399 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse398 (select (select .cse397 .cse384) .cse400))) (let ((.cse391 (select .cse397 .cse398)) (.cse393 (select .cse399 .cse398)) (.cse392 (+ (select (select .cse399 .cse384) .cse400) 4))) (let ((.cse389 (store .cse399 .cse398 (store .cse393 .cse392 0))) (.cse385 (store .cse397 .cse398 (store .cse391 .cse392 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse388 (select (select .cse385 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse396 (+ (select (select .cse389 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse394 (select (select .cse385 .cse388) .cse396)) (.cse395 (+ (select (select .cse389 .cse388) .cse396) 4))) (let ((.cse390 (select (select .cse389 .cse394) .cse395))) (let ((.cse386 (select (select .cse385 .cse394) .cse395)) (.cse387 (+ .cse390 4))) (or (= (select (select .cse385 .cse386) .cse387) .cse388) (= .cse388 0) (= (select (select .cse389 .cse386) .cse387) 0) (= .cse390 0) (not (= 0 (select .cse391 .cse392))) (not (= (select .cse393 .cse392) 0))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse416 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse401 (select (select .cse416 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse401) (forall ((v_ArrVal_2277 Int)) (let ((.cse414 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse417 (select (select .cse414 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse418 (+ .cse401 4))) (let ((.cse415 (select (select .cse414 .cse417) .cse418))) (let ((.cse409 (select .cse416 .cse415)) (.cse408 (+ (select (select .cse416 .cse417) .cse418) 4))) (let ((.cse407 (select .cse414 .cse415)) (.cse403 (store .cse416 .cse415 (store .cse409 .cse408 0)))) (let ((.cse406 (select (select .cse403 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse410 (store .cse414 .cse415 (store .cse407 .cse408 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse402 (select (select .cse410 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse413 (+ .cse406 4))) (let ((.cse411 (select (select .cse410 .cse402) .cse413)) (.cse412 (+ (select (select .cse403 .cse402) .cse413) 4))) (let ((.cse404 (select (select .cse410 .cse411) .cse412)) (.cse405 (+ (select (select .cse403 .cse411) .cse412) 4))) (or (= .cse402 0) (= (select (select .cse403 .cse404) .cse405) .cse406) (not (= 0 (select .cse407 .cse408))) (not (= (select .cse409 .cse408) 0)) (= .cse404 0) (= (select (select .cse410 .cse404) .cse405) 0)))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse433 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse419 (select (select .cse433 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse419) (forall ((v_ArrVal_2276 Int)) (let ((.cse435 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse436 (+ (select (select .cse435 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse434 (select (select .cse433 .cse419) .cse436))) (let ((.cse428 (select .cse435 .cse434)) (.cse427 (+ (select (select .cse435 .cse419) .cse436) 4))) (let ((.cse426 (select .cse433 .cse434)) (.cse421 (store .cse435 .cse434 (store .cse428 .cse427 0)))) (let ((.cse424 (select (select .cse421 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse429 (store .cse433 .cse434 (store .cse426 .cse427 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse420 (select (select .cse429 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse432 (+ .cse424 4))) (let ((.cse430 (select (select .cse429 .cse420) .cse432)) (.cse431 (+ (select (select .cse421 .cse420) .cse432) 4))) (let ((.cse425 (select (select .cse421 .cse430) .cse431))) (let ((.cse422 (select (select .cse429 .cse430) .cse431)) (.cse423 (+ .cse425 4))) (or (= .cse420 0) (= (select (select .cse421 .cse422) .cse423) .cse424) (= .cse425 0) (not (= 0 (select .cse426 .cse427))) (not (= (select .cse428 .cse427) 0)) (= (select (select .cse429 .cse422) .cse423) 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse449 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse452 (select (select .cse449 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse451 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse453 (+ (select (select .cse451 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse450 (select (select .cse449 .cse452) .cse453))) (let ((.cse442 (select .cse451 .cse450)) (.cse441 (+ (select (select .cse451 .cse452) .cse453) 4))) (let ((.cse440 (select .cse449 .cse450)) (.cse444 (store .cse451 .cse450 (store .cse442 .cse441 0)))) (let ((.cse439 (select (select .cse444 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse447 (store .cse449 .cse450 (store .cse440 .cse441 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse437 (select (select .cse447 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse448 (+ .cse439 4))) (let ((.cse445 (select (select .cse447 .cse437) .cse448)) (.cse446 (+ (select (select .cse444 .cse437) .cse448) 4))) (let ((.cse443 (select (select .cse447 .cse445) .cse446))) (let ((.cse438 (select (select .cse444 .cse443) (+ (select (select .cse444 .cse445) .cse446) 4)))) (or (= .cse437 0) (= .cse438 .cse439) (= .cse438 0) (not (= 0 (select .cse440 .cse441))) (not (= (select .cse442 .cse441) 0)) (= .cse443 0))))))))))))) (= 0 .cse452))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2276 Int)) (let ((.cse469 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse454 (select (select .cse469 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse454) (forall ((v_ArrVal_2277 Int)) (let ((.cse467 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse470 (select (select .cse467 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse471 (+ .cse454 4))) (let ((.cse468 (select (select .cse467 .cse470) .cse471))) (let ((.cse459 (select .cse469 .cse468)) (.cse458 (+ (select (select .cse469 .cse470) .cse471) 4))) (let ((.cse457 (select .cse467 .cse468)) (.cse461 (store .cse469 .cse468 (store .cse459 .cse458 0)))) (let ((.cse456 (select (select .cse461 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse464 (store .cse467 .cse468 (store .cse457 .cse458 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse465 (select (select .cse464 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse466 (+ .cse456 4))) (let ((.cse462 (select (select .cse464 .cse465) .cse466)) (.cse463 (+ (select (select .cse461 .cse465) .cse466) 4))) (let ((.cse460 (select (select .cse464 .cse462) .cse463))) (let ((.cse455 (select (select .cse461 .cse460) (+ (select (select .cse461 .cse462) .cse463) 4)))) (or (= .cse455 .cse456) (= .cse455 0) (not (= 0 (select .cse457 .cse458))) (not (= (select .cse459 .cse458) 0)) (= .cse460 0) (= .cse456 0))))))))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2277 Int)) (let ((.cse484 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse487 (select (select .cse484 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse486 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse488 (+ (select (select .cse486 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse485 (select (select .cse484 .cse487) .cse488))) (let ((.cse478 (select .cse486 .cse485)) (.cse477 (+ (select (select .cse486 .cse487) .cse488) 4))) (let ((.cse476 (select .cse484 .cse485)) (.cse472 (store .cse486 .cse485 (store .cse478 .cse477 0)))) (let ((.cse475 (select (select .cse472 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse479 (store .cse484 .cse485 (store .cse476 .cse477 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse482 (select (select .cse479 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse483 (+ .cse475 4))) (let ((.cse480 (select (select .cse479 .cse482) .cse483)) (.cse481 (+ (select (select .cse472 .cse482) .cse483) 4))) (let ((.cse473 (select (select .cse479 .cse480) .cse481)) (.cse474 (+ (select (select .cse472 .cse480) .cse481) 4))) (or (= (select (select .cse472 .cse473) .cse474) .cse475) (not (= 0 (select .cse476 .cse477))) (not (= (select .cse478 .cse477) 0)) (= .cse473 0) (= .cse475 0) (= (select (select .cse479 .cse473) .cse474) 0)))))))))))) (= 0 .cse487))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2277 Int)) (let ((.cse502 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse505 (select (select .cse502 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse504 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse506 (+ (select (select .cse504 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse503 (select (select .cse502 .cse505) .cse506))) (let ((.cse497 (select .cse504 .cse503)) (.cse496 (+ (select (select .cse504 .cse505) .cse506) 4))) (let ((.cse495 (select .cse502 .cse503)) (.cse493 (store .cse504 .cse503 (store .cse497 .cse496 0)))) (let ((.cse498 (select (select .cse493 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse489 (store .cse502 .cse503 (store .cse495 .cse496 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse492 (select (select .cse489 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse501 (+ .cse498 4))) (let ((.cse499 (select (select .cse489 .cse492) .cse501)) (.cse500 (+ (select (select .cse493 .cse492) .cse501) 4))) (let ((.cse494 (select (select .cse493 .cse499) .cse500))) (let ((.cse490 (select (select .cse489 .cse499) .cse500)) (.cse491 (+ .cse494 4))) (or (= (select (select .cse489 .cse490) .cse491) .cse492) (= (select (select .cse493 .cse490) .cse491) 0) (= .cse494 0) (not (= 0 (select .cse495 .cse496))) (not (= (select .cse497 .cse496) 0)) (= .cse498 0))))))))))))) (= 0 .cse505))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse523 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse507 (select (select .cse523 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse507) (forall ((v_ArrVal_2277 Int)) (let ((.cse521 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse524 (select (select .cse521 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse525 (+ .cse507 4))) (let ((.cse522 (select (select .cse521 .cse524) .cse525))) (let ((.cse515 (select .cse523 .cse522)) (.cse514 (+ (select (select .cse523 .cse524) .cse525) 4))) (let ((.cse513 (select .cse521 .cse522)) (.cse508 (store .cse523 .cse522 (store .cse515 .cse514 0)))) (let ((.cse511 (select (select .cse508 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse516 (store .cse521 .cse522 (store .cse513 .cse514 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse519 (select (select .cse516 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse520 (+ .cse511 4))) (let ((.cse517 (select (select .cse516 .cse519) .cse520)) (.cse518 (+ (select (select .cse508 .cse519) .cse520) 4))) (let ((.cse512 (select (select .cse508 .cse517) .cse518))) (let ((.cse509 (select (select .cse516 .cse517) .cse518)) (.cse510 (+ .cse512 4))) (or (= (select (select .cse508 .cse509) .cse510) .cse511) (= .cse512 0) (not (= 0 (select .cse513 .cse514))) (not (= (select .cse515 .cse514) 0)) (= .cse511 0) (= (select (select .cse516 .cse509) .cse510) 0))))))))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|))) (forall ((v_ArrVal_2276 Int)) (let ((.cse541 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse526 (select (select .cse541 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (= 0 .cse526) (forall ((v_ArrVal_2277 Int)) (let ((.cse539 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse542 (select (select .cse539 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse543 (+ .cse526 4))) (let ((.cse540 (select (select .cse539 .cse542) .cse543))) (let ((.cse533 (select .cse541 .cse540)) (.cse532 (+ (select (select .cse541 .cse542) .cse543) 4))) (let ((.cse531 (select .cse539 .cse540)) (.cse527 (store .cse541 .cse540 (store .cse533 .cse532 0)))) (let ((.cse530 (select (select .cse527 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse534 (store .cse539 .cse540 (store .cse531 .cse532 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse537 (select (select .cse534 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse538 (+ .cse530 4))) (let ((.cse535 (select (select .cse534 .cse537) .cse538)) (.cse536 (+ (select (select .cse527 .cse537) .cse538) 4))) (let ((.cse528 (select (select .cse534 .cse535) .cse536)) (.cse529 (+ (select (select .cse527 .cse535) .cse536) 4))) (or (= (select (select .cse527 .cse528) .cse529) .cse530) (not (= 0 (select .cse531 .cse532))) (not (= (select .cse533 .cse532) 0)) (= .cse528 0) (= .cse530 0) (= (select (select .cse534 .cse528) .cse529) 0)))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2277 Int)) (let ((.cse555 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2277)))) (let ((.cse558 (select (select .cse555 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_2276 Int)) (let ((.cse557 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|) 4 0) 0 v_ArrVal_2276)))) (let ((.cse559 (+ (select (select .cse557 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse556 (select (select .cse555 .cse558) .cse559))) (let ((.cse549 (select .cse555 .cse556)) (.cse551 (select .cse557 .cse556)) (.cse550 (+ (select (select .cse557 .cse558) .cse559) 4))) (let ((.cse548 (store .cse557 .cse556 (store .cse551 .cse550 0))) (.cse544 (store .cse555 .cse556 (store .cse549 .cse550 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))) (let ((.cse547 (select (select .cse544 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse554 (+ (select (select .cse548 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse552 (select (select .cse544 .cse547) .cse554)) (.cse553 (+ (select (select .cse548 .cse547) .cse554) 4))) (let ((.cse546 (+ (select (select .cse548 .cse552) .cse553) 4)) (.cse545 (select (select .cse544 .cse552) .cse553))) (or (= (select (select .cse544 .cse545) .cse546) .cse547) (= .cse547 0) (= (select (select .cse548 .cse545) .cse546) 0) (not (= 0 (select .cse549 .cse550))) (not (= (select .cse551 .cse550) 0)) (= .cse545 0))))))))))) (= 0 .cse558))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_36|)))))) is different from true [2023-02-16 01:11:18,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995860455] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:18,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:11:18,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2023-02-16 01:11:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236075750] [2023-02-16 01:11:18,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:11:18,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-16 01:11:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:18,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-16 01:11:18,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=4456, Unknown=2, NotChecked=134, Total=4830 [2023-02-16 01:11:18,564 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 54 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 46 states have internal predecessors, (76), 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-16 01:11:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:26,814 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2023-02-16 01:11:26,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-16 01:11:26,814 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 46 states have internal predecessors, (76), 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 46 [2023-02-16 01:11:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:26,815 INFO L225 Difference]: With dead ends: 86 [2023-02-16 01:11:26,815 INFO L226 Difference]: Without dead ends: 54 [2023-02-16 01:11:26,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=916, Invalid=10858, Unknown=2, NotChecked=214, Total=11990 [2023-02-16 01:11:26,817 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 232 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:26,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 517 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-16 01:11:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-16 01:11:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2023-02-16 01:11:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 01:11:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2023-02-16 01:11:26,835 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 46 [2023-02-16 01:11:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:26,835 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2023-02-16 01:11:26,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 46 states have internal predecessors, (76), 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-16 01:11:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2023-02-16 01:11:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 01:11:26,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:26,836 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:26,842 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-16 01:11:27,043 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,SelfDestructingSolverStorable15 [2023-02-16 01:11:27,043 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:27,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2111425896, now seen corresponding path program 3 times [2023-02-16 01:11:27,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:27,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54204753] [2023-02-16 01:11:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:27,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 01:11:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:27,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:11:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:27,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-16 01:11:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:27,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 01:11:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-16 01:11:27,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:27,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54204753] [2023-02-16 01:11:27,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54204753] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:27,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252669907] [2023-02-16 01:11:27,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 01:11:27,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:27,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:11:27,139 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-16 01:11:27,165 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-16 01:11:27,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-16 01:11:27,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:11:27,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 01:11:27,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:11:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 01:11:27,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:11:27,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252669907] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:11:27,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 01:11:27,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-16 01:11:27,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439310773] [2023-02-16 01:11:27,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:11:27,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 01:11:27,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:27,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 01:11:27,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 01:11:27,450 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-16 01:11:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:27,462 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2023-02-16 01:11:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 01:11:27,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 51 [2023-02-16 01:11:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:27,463 INFO L225 Difference]: With dead ends: 55 [2023-02-16 01:11:27,463 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 01:11:27,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 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-16 01:11:27,467 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:27,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:11:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 01:11:27,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 01:11:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:11:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 01:11:27,468 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2023-02-16 01:11:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:27,468 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 01:11:27,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-16 01:11:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 01:11:27,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 01:11:27,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 01:11:27,495 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-16 01:11:27,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:27,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-16 01:11:43,824 WARN L233 SmtUtils]: Spent 15.13s on a formula simplification. DAG size of input: 46 DAG size of output: 16 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-02-16 01:11:56,165 WARN L233 SmtUtils]: Spent 10.35s on a formula simplification. DAG size of input: 325 DAG size of output: 183 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-02-16 01:12:30,437 WARN L233 SmtUtils]: Spent 33.13s on a formula simplification. DAG size of input: 607 DAG size of output: 429 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-02-16 01:12:30,443 INFO L899 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2023-02-16 01:12:30,444 INFO L895 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse59 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse65 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) (.cse60 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|)) (.cse24 (select |#memory_$Pointer$.base| .cse59))) (let ((.cse25 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse14 (select .cse24 4)) (.cse61 (select .cse60 4)) (.cse63 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse65))) (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (= |ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse2 (not (= 0 .cse63))) (.cse3 (not (= 0 .cse61))) (.cse4 (not (= |ULTIMATE.start_sll_append_~head#1.base| .cse59))) (.cse5 (= (select |#valid| .cse63) 1)) (.cse6 (= (select |#valid| .cse14) 1)) (.cse7 (< .cse59 |#StackHeapBarrier|)) (.cse8 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse9 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse10 (< .cse61 |#StackHeapBarrier|)) (.cse11 (= (select .cse64 4) 0)) (.cse12 (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse13 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse15 (= (select (select |#memory_int| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse16 (< |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|)) (.cse17 (= (select (select |#memory_int| .cse63) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse18 (= (select (select |#memory_$Pointer$.offset| .cse61) 4) 0)) (.cse19 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse20 (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|))) (.cse21 (not (= 0 |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse22 (= 1 (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))) (.cse23 (< .cse63 |#StackHeapBarrier|)) (.cse26 (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|)) (.cse27 (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_append_~head#1.offset|)) (.cse28 (< |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|)) (.cse29 (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse30 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse31 (< .cse14 |#StackHeapBarrier|)) (.cse32 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|) |ULTIMATE.start_main_~data~0#1|)) (.cse33 (= 1 (select |#valid| .cse61))) (.cse34 (not (= 0 .cse14))) (.cse35 (= (select (select |#memory_$Pointer$.base| .cse63) (+ (select .cse64 .cse65) 4)) 0)) (.cse36 (= (select |#valid| .cse59) 1)) (.cse37 (= (select (select |#memory_$Pointer$.offset| .cse63) 4) 0)) (.cse38 (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse39 (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse14) 1) (= (let ((.cse62 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse62 (select |v_#valid_BEFORE_CALL_30| .cse62))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_30| .cse59) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| |ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| .cse59) 0)))) (.cse40 (= 0 (select (select |#memory_$Pointer$.offset| .cse59) 4))) (.cse41 (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse42 (= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (.cse43 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_main_~data~0#1|)) (.cse44 (= (select (select |#memory_$Pointer$.offset| .cse14) 4) 0)) (.cse45 (or (<= 1 |ULTIMATE.start_sll_create_#res#1.base|) (<= (+ |ULTIMATE.start_sll_create_#res#1.base| 1) 0))) (.cse46 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (.cse47 (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|))) (.cse48 (= (select (select |#memory_$Pointer$.base| .cse61) 4) 0)) (.cse49 (not (= 0 |ULTIMATE.start_sll_append_~new_last~0#1.base|))) (.cse50 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse51 (= |ULTIMATE.start_sll_append_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse52 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse53 (= |ULTIMATE.start_sll_append_~head#1.offset| 0)) (.cse54 (= (select (select |#memory_int| .cse59) .cse25) |ULTIMATE.start_main_~data~0#1|)) (.cse55 (= .cse25 0)) (.cse56 (= (select (select |#memory_int| (select .cse60 (+ |ULTIMATE.start_sll_create_#res#1.offset| 4))) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse57 (not (= 0 .cse59))) (.cse58 (= (select (select |#memory_int| .cse14) 0) |ULTIMATE.start_main_~data~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (select (select |#memory_$Pointer$.base| .cse14) 4) 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= |ULTIMATE.start_sll_append_~last~0#1.base| (select .cse24 (+ .cse25 4))) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse59) .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) 4) 0) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58)))))) [2023-02-16 01:12:30,444 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 609) no Hoare annotation was computed. [2023-02-16 01:12:30,444 INFO L899 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2023-02-16 01:12:30,444 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-02-16 01:12:30,444 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 611 633) the Hoare annotation is: true [2023-02-16 01:12:30,445 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 625) the Hoare annotation is: (let ((.cse124 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse134 (select |#memory_$Pointer$.offset| .cse56)) (.cse135 (+ .cse124 4)) (.cse136 (select |#memory_$Pointer$.base| .cse56))) (let ((.cse133 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse131 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) (.cse126 (select .cse136 4)) (.cse57 (select |#memory_$Pointer$.base| (select .cse136 .cse135))) (.cse128 (select .cse134 .cse135)) (.cse13 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) .cse13)) (.cse58 (select .cse134 4)) (.cse132 (select .cse57 (+ .cse128 4))) (.cse125 (select (select |#memory_$Pointer$.base| .cse126) 4)) (.cse127 (select .cse133 .cse131)) (.cse130 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse129 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse120 (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse17 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~temp~2#1.base|) 4) 0)) (.cse32 (not (= 0 |ULTIMATE.start_main_~temp~2#1.base|))) (.cse20 (not (= 0 |ULTIMATE.start_main_~ptr~0#1.base|))) (.cse25 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~temp~2#1.base|) 4)) (.cse2 (= |ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_sll_append_~head#1.base| .cse56))) (.cse10 (= .cse120 1)) (.cse12 (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse129))) (.cse14 (= (select .cse130 4) 0)) (.cse18 (= |ULTIMATE.start_main_~temp~2#1.offset| 0)) (.cse21 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse33 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse34 (not (= |ULTIMATE.start_sll_append_~head#1.base| .cse126))) (.cse35 (not (= |ULTIMATE.start_main_~#s~0#1.base| (select .cse133 4)))) (.cse40 (or (<= 1 |ULTIMATE.start_sll_create_#res#1.base|) (<= (+ |ULTIMATE.start_sll_create_#res#1.base| 1) 0))) (.cse42 (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|))) (.cse44 (not (= 0 |ULTIMATE.start_sll_append_~new_last~0#1.base|))) (.cse48 (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) 4)))) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse67 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse3 (not (= 0 .cse127))) (.cse4 (not (= 0 .cse129))) (.cse5 (= (select (select |#memory_$Pointer$.offset| .cse125) 4) 0)) (.cse7 (= (select |#valid| .cse129) 1)) (.cse8 (= (select |#valid| .cse127) 1)) (.cse9 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse81 (< .cse56 |#StackHeapBarrier|)) (.cse11 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse83 (< .cse129 |#StackHeapBarrier|)) (.cse15 (not (= .cse129 |ULTIMATE.start_sll_create_#res#1.base|))) (.cse16 (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse84 (<= (+ .cse132 2) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse19 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse87 (= (select (select |#memory_int| .cse127) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse88 (or (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) 0) (not (<= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)))) (.cse22 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse23 (= .cse58 0)) (.cse24 (not (= 0 |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse66 (< .cse127 |#StackHeapBarrier|)) (.cse26 (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|)) (.cse68 (< |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|)) (.cse27 (= .cse126 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse69 (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse28 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse70 (or (not (<= .cse132 0)) (<= (+ .cse132 1) 0))) (.cse71 (< .cse126 |#StackHeapBarrier|)) (.cse78 (= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (not (= 0 .cse126))) (.cse31 (= (select |#valid| .cse56) 1)) (.cse79 (= (select .cse130 .cse131) 0)) (.cse59 (= (select (select |#memory_int| .cse56) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse80 (= (select (select |#memory_int| .cse129) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse82 (not (= 0 |ULTIMATE.start_sll_create_#res#1.base|))) (.cse36 (= |ULTIMATE.start_sll_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse52 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse38 (= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (.cse39 (= (select (select |#memory_$Pointer$.offset| .cse126) 4) 0)) (.cse85 (= |ULTIMATE.start_sll_append_~last~0#1.offset| .cse128)) (.cse43 (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse41 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (.cse45 (not (= .cse127 |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse86 (= |ULTIMATE.start_sll_append_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse46 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse47 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse53 (select (select |#memory_$Pointer$.base| .cse1) 4)) (.cse49 (not (= 0 .cse56))) (.cse50 (= 1 (select |#valid| .cse126))) (.cse89 (= (select (select |#memory_int| .cse126) 0) |ULTIMATE.start_main_~data~0#1|)) (.cse51 (= (select (select |#memory_$Pointer$.base| .cse125) 4) 0))) (or (and .cse0 (= .cse1 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) .cse13) 0) .cse14 .cse15 .cse16 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= .cse25 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) .cse26 .cse27 .cse28 (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimIndex_62 Int) (v_arrayElimIndex_61 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (let ((.cse29 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse29 (select |v_#valid_BEFORE_CALL_30| .cse29))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_61) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_62) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_61) 1) (= 0 (select |v_#valid_BEFORE_CALL_30| |ULTIMATE.start_main_~ptr~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| v_arrayElimIndex_62) 0)))) (<= 2 |ULTIMATE.start_main_~count~0#1|) .cse30 .cse31 .cse32 (<= |ULTIMATE.start_main_~count~0#1| 2) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse22 (<= |ULTIMATE.start_main_~count~0#1| 1) .cse2 .cse37 (= (select (select |#memory_$Pointer$.offset| .cse1) 4) 0) .cse27 .cse52 (= (select (select |#memory_$Pointer$.base| .cse25) 4) 0) .cse16 (= .cse53 0) .cse39 .cse5 .cse17 .cse18 (or (and (exists ((|ULTIMATE.start_main_~#s~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse55 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse54 (select (select |#memory_$Pointer$.base| .cse55) 4))) (and (not (= 0 .cse54)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse55)) (not (= .cse54 .cse55)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse55) (not (= 0 .cse55)))))) .cse23 .cse26 .cse28 .cse3 (<= (+ .cse56 2) |ULTIMATE.start_main_~#s~0#1.base|) .cse4 (= (select .cse57 (+ .cse58 4)) 0) .cse30 .cse31 .cse7 .cse8 .cse33 .cse59 .cse34 .cse35 .cse9 .cse10 .cse11 .cse36 .cse12 .cse38 .cse14 .cse15 .cse41 .cse42 .cse43 .cse44 .cse46 .cse45 .cse47) (and .cse24 (or (exists ((v_prenex_2 Int)) (let ((.cse60 (select (select |#memory_$Pointer$.base| v_prenex_2) 0))) (let ((.cse62 (select (select |#memory_$Pointer$.base| .cse60) 4))) (let ((.cse61 (select (select |#memory_$Pointer$.base| .cse62) 4))) (and (not (= 0 .cse60)) (not (<= .cse61 0)) (not (= v_prenex_2 .cse62)) (not (= .cse61 .cse62)) (not (= .cse61 .cse60)) (= |ULTIMATE.start_main_~temp~2#1.base| .cse62) (not (= v_prenex_2 .cse60)) (<= (+ .cse61 2) v_prenex_2)))))) (exists ((v_prenex_2 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse63 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse64 (select (select |#memory_$Pointer$.base| .cse63) 4))) (let ((.cse65 (select (select |#memory_$Pointer$.base| .cse64) 4))) (and (not (= 0 .cse63)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse64)) (not (= (select (select |#memory_$Pointer$.base| v_prenex_2) 0) |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse65 1) 0) (not (= .cse65 .cse63)) (= |ULTIMATE.start_main_~temp~2#1.base| .cse64) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse63)) (not (= .cse65 .cse64)) (<= (+ .cse65 2) |ULTIMATE.start_main_~#s~0#1.base|))))))) .cse66 .cse26 .cse67 .cse68 .cse69 .cse3 .cse28 .cse70 .cse71 (or (exists ((v_prenex_2 Int)) (let ((.cse72 (select (select |#memory_$Pointer$.base| v_prenex_2) 0))) (let ((.cse74 (select (select |#memory_$Pointer$.base| .cse72) 4))) (let ((.cse73 (select (select |#memory_$Pointer$.base| .cse74) 4))) (and (not (= 0 .cse72)) (not (<= .cse73 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse74) (not (= v_prenex_2 .cse74)) (not (= .cse73 .cse74)) (not (= .cse73 .cse72)) (not (= v_prenex_2 .cse72)) (<= (+ .cse73 2) v_prenex_2)))))) (exists ((v_prenex_2 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse75 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse76 (select (select |#memory_$Pointer$.base| .cse75) 4))) (let ((.cse77 (select (select |#memory_$Pointer$.base| .cse76) 4))) (and (not (= 0 .cse75)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse76)) (not (= (select (select |#memory_$Pointer$.base| v_prenex_2) 0) |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse77 1) 0) (not (= .cse77 .cse75)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse75)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse76) (not (= .cse77 .cse76)) (<= (+ .cse77 2) |ULTIMATE.start_main_~#s~0#1.base|))))))) .cse4 .cse78 .cse30 .cse31 .cse7 .cse32 .cse8 .cse79 .cse80 .cse81 .cse9 .cse82 .cse10 .cse11 .cse36 .cse83 .cse38 (= (select (select |#memory_int| |ULTIMATE.start_main_~temp~2#1.base|) 0) |ULTIMATE.start_main_~data~0#1|) .cse15 .cse84 .cse85 .cse43 .cse41 .cse86 .cse45 .cse46 .cse47 .cse20 .cse87 .cse49 .cse88 .cse89)) .cse19 .cse48 (= (select (select |#memory_$Pointer$.offset| .cse25) 4) 0) (<= 1 |ULTIMATE.start_main_~count~0#1|) (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse94 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse96 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse98 (+ .cse94 4))) (let ((.cse91 (select (select |#memory_$Pointer$.offset| .cse96) .cse98))) (let ((.cse93 (select (select |#memory_$Pointer$.base| .cse96) .cse98)) (.cse97 (+ .cse91 4))) (let ((.cse95 (select (select |#memory_$Pointer$.base| .cse93) .cse97))) (and (= (let ((.cse90 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse90 (select |v_#valid_BEFORE_CALL_29| .cse90))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= .cse91 0) (= (let ((.cse92 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse92 (select |v_#valid_BEFORE_CALL_30| .cse92))) |v_#valid_BEFORE_CALL_30|) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse93) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse91) (= (select |v_#valid_BEFORE_CALL_28| .cse93) 1) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse94 0) (<= (+ .cse93 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse95)) (<= (+ .cse95 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse96) 0) (= (select (select |#memory_int| .cse95) 0) |ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_30| .cse96) 1) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= (select (select |#memory_$Pointer$.offset| .cse93) .cse97) 0)))))))) .cse50 .cse21 .cse51) (and .cse0 .cse2 .cse3 (= 0 |ULTIMATE.start_main_~ptr~0#1.offset|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_main_~temp~2#1.base| 0) .cse12 (= |ULTIMATE.start_main_~ptr~0#1.base| 0) .cse14 .cse15 .cse16 (not (<= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~len~0#1|)) .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27 .cse28 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse52 .cse38 (<= |ULTIMATE.start_main_~count~0#1| 3) .cse39 .cse40 .cse41 .cse42 .cse44 .cse46 .cse45 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse67 .cse3 (= |ULTIMATE.start_main_~count~0#1| 0) .cse4 .cse5 .cse7 .cse8 .cse9 .cse81 (exists ((v_arrayElimIndex_53 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (v_arrayElimCell_198 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse102 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse104 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse107 (+ .cse102 4))) (let ((.cse100 (select (select |#memory_$Pointer$.offset| .cse104) .cse107))) (let ((.cse103 (select (select |#memory_$Pointer$.base| .cse104) .cse107)) (.cse106 (+ .cse100 4))) (let ((.cse105 (select (select |#memory_$Pointer$.base| .cse103) .cse106))) (and (= (let ((.cse99 (@diff |v_#valid_BEFORE_CALL_31| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_31| .cse99 (select |v_#valid_BEFORE_CALL_29| .cse99))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_198) 1) (= .cse100 0) (= (let ((.cse101 (@diff |v_#valid_BEFORE_CALL_28| |v_#valid_BEFORE_CALL_30|))) (store |v_#valid_BEFORE_CALL_28| .cse101 (select |v_#valid_BEFORE_CALL_30| .cse101))) |v_#valid_BEFORE_CALL_30|) (= (select |v_#valid_BEFORE_CALL_29| v_arrayElimIndex_53) 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse102) (<= (+ v_arrayElimCell_198 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse103) 1) (= .cse102 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse104) (<= (+ .cse103 2) |ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select |v_#valid_BEFORE_CALL_30| .cse105)) (<= (+ .cse105 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse104) 0) (= (select (select |#memory_int| .cse105) 0) |ULTIMATE.start_main_~data~0#1|) (= (select |v_#valid_BEFORE_CALL_30| .cse104) 1) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_53) 0) (= (select (select |#memory_$Pointer$.offset| .cse103) .cse106) 0)))))))) .cse11 .cse83 .cse15 .cse16 .cse84 .cse19 .cse87 (or (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse112 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse111 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse113 (+ .cse112 4))) (let ((.cse109 (select (select |#memory_$Pointer$.base| .cse111) .cse113)) (.cse110 (select |#memory_$Pointer$.offset| .cse111))) (let ((.cse108 (select (select |#memory_$Pointer$.base| .cse109) (+ (select .cse110 .cse113) 4)))) (and (<= (+ .cse108 2) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse109)) (= (select .cse110 4) 0) (not (= 0 .cse111)) (<= (+ .cse108 1) 0) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse111)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse112) (not (= .cse108 .cse109)) (not (= .cse108 .cse111)) (= .cse112 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse111))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse118 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse117 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse119 (+ .cse118 4))) (let ((.cse115 (select (select |#memory_$Pointer$.base| .cse117) .cse119)) (.cse116 (select |#memory_$Pointer$.offset| .cse117))) (let ((.cse114 (select (select |#memory_$Pointer$.base| .cse115) (+ (select .cse116 .cse119) 4)))) (and (<= (+ .cse114 2) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse115)) (= (select .cse116 4) 0) (not (= 0 .cse117)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse117)) (not (<= .cse114 0)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse118) (not (= .cse114 .cse115)) (not (= .cse114 .cse117)) (= .cse118 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse117)))))))) .cse88 .cse22 .cse23 (= (select (select |#memory_$Pointer$.base| .cse53) 4) 0) .cse24 (= 1 .cse120) .cse66 .cse26 .cse68 .cse27 .cse69 .cse28 .cse70 .cse71 .cse78 (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse121 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse123 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse122 (select (select |#memory_$Pointer$.base| .cse121) 4))) (and (= (select (select |#memory_$Pointer$.offset| .cse121) 4) 0) (<= (+ .cse122 2) |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse122 .cse121)) (not (= 0 .cse121)) (not (= 0 .cse122)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse123) (<= (+ .cse121 2) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse123 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse121) (= (select (select |#memory_int| .cse122) 0) |ULTIMATE.start_main_~data~0#1|))))) .cse30 .cse31 .cse79 .cse59 .cse80 .cse82 .cse36 .cse37 .cse52 .cse38 .cse39 .cse85 .cse43 .cse41 .cse45 .cse86 .cse46 .cse47 (= (select (select |#memory_$Pointer$.offset| .cse53) 4) 0) (= .cse124 0) .cse49 .cse50 .cse89 .cse51))))))) [2023-02-16 01:12:30,446 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2023-02-16 01:12:30,446 INFO L899 garLoopResultBuilder]: For program point L618-3(lines 611 633) no Hoare annotation was computed. [2023-02-16 01:12:30,446 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse18 (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1)) (.cse14 (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|))) (.cse2 (= .cse14 1)) (.cse3 (or (<= 1 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= .cse18 0))) (.cse4 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse5 (<= .cse18 |#StackHeapBarrier|)) (.cse6 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_main_~data~0#1|)) (.cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse10 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse11 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse12 (select .cse17 4)) (.cse13 (= |ULTIMATE.start_main_~#s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= .cse12 0) .cse13 (<= |ULTIMATE.start_sll_create_~len#1| 1) (<= 1 |ULTIMATE.start_sll_create_~len#1|)) (and .cse0 .cse1 (= |ULTIMATE.start_sll_create_~len#1| 2) .cse4 (= 1 .cse14) .cse11 .cse6 .cse7 .cse13 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (let ((.cse15 (select .cse17 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ .cse15 1) |#StackHeapBarrier|) .cse5 .cse6 (not (= 0 .cse15)) .cse7 .cse8 .cse9 (= (select (select |#memory_$Pointer$.base| .cse15) 4) 0) .cse10 (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse15) 1) (= (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_28| |#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse16 (select |#valid| .cse16))) |#valid|) (= (select |v_#valid_BEFORE_CALL_28| |ULTIMATE.start_sll_create_~head~0#1.base|) 0))) .cse11 (= (select (select |#memory_$Pointer$.offset| .cse12) 4) 0) .cse13 (<= |ULTIMATE.start_sll_create_~len#1| 0) (= (select (select |#memory_int| .cse15) 0) |ULTIMATE.start_main_~data~0#1|)))))) [2023-02-16 01:12:30,446 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-02-16 01:12:30,446 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-16 01:12:30,446 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-16 01:12:30,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 631) no Hoare annotation was computed. [2023-02-16 01:12:30,447 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|))) (.cse3 (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse5 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_sll_create_~len#1| 2) .cse2 (= 1 .cse3) .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (and .cse0 .cse1 (= .cse3 1) (not (= 0 |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse2 (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) .cse5 .cse6 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_main_~data~0#1|) (= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse4 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (<= |ULTIMATE.start_sll_create_~len#1| 1) (<= 1 |ULTIMATE.start_sll_create_~len#1|)))) [2023-02-16 01:12:30,447 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-02-16 01:12:30,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-16 01:12:30,447 INFO L899 garLoopResultBuilder]: For program point L599(lines 599 610) no Hoare annotation was computed. [2023-02-16 01:12:30,447 INFO L895 garLoopResultBuilder]: At program point sll_create_returnLabel#1(lines 583 591) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|)) (.cse6 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse6)) (.cse1 (select .cse5 (+ |ULTIMATE.start_sll_create_#res#1.offset| 4))) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse6)) (.cse3 (select .cse5 4))) (and (= |ULTIMATE.start_main_~len~0#1| 2) (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (< .cse0 |#StackHeapBarrier|) (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (< |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|) (not (= 0 .cse0)) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= 0 .cse1)) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.base| .cse0) (+ .cse2 4)) 0) (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_28| |#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse4 (select |#valid| .cse4))) |#valid|) (= (select |v_#valid_BEFORE_CALL_28| |ULTIMATE.start_sll_create_#res#1.base|) 0))) (= (select |#valid| .cse0) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= (+ .cse3 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (or (<= 1 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_main_~data~0#1|) (or (<= 1 |ULTIMATE.start_sll_create_#res#1.base|) (<= (+ |ULTIMATE.start_sll_create_#res#1.base| 1) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.base| .cse3) 4) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_int| .cse1) 0) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_int| .cse0) 0) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| .cse3) 4) 0)))) [2023-02-16 01:12:30,447 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2023-02-16 01:12:30,448 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-16 01:12:30,448 INFO L895 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|)) (.cse10 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse5 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse10)) (.cse8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 (+ |ULTIMATE.start_sll_create_#res#1.offset| 4))) (.cse0 (select .cse2 .cse10)) (.cse4 (select .cse9 4)) (.cse1 (select (select |#memory_$Pointer$.base| .cse6) 4))) (and (= |ULTIMATE.start_main_~len~0#1| 2) (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (< .cse0 |#StackHeapBarrier|) (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (< |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|) (not (= 0 .cse0)) (= |ULTIMATE.start_main_~data~0#1| 1) (< .cse1 |#StackHeapBarrier|) (= 1 (select |#valid| (select .cse2 4))) (not (= 0 .cse3)) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|) |ULTIMATE.start_main_~data~0#1|) (= 1 (select |#valid| .cse4)) (not (= 0 .cse1)) (= (select (select |#memory_$Pointer$.base| .cse0) (+ .cse5 4)) 0) (= (select |#valid| .cse6) 1) (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_28| |#valid|))) (store |v_#valid_BEFORE_CALL_28| .cse7 (select |#valid| .cse7))) |#valid|) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 0))) (= .cse5 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (< .cse6 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (or (<= 1 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) 0)) (= 0 (select (select |#memory_$Pointer$.offset| .cse6) 4)) (= |ULTIMATE.start_sll_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (< .cse4 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| .cse1) 4) 0) (or (<= 1 |ULTIMATE.start_sll_create_#res#1.base|) (<= (+ |ULTIMATE.start_sll_create_#res#1.base| 1) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.base| .cse4) 4) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_append_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |#memory_int| .cse6) .cse8) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.base| .cse1) 4) 0) (= .cse8 0) (= (select (select |#memory_int| .cse3) 0) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_int| .cse0) 0) |ULTIMATE.start_main_~data~0#1|) (not (= 0 .cse6)) (= (select (select |#memory_$Pointer$.offset| .cse4) 4) 0) (= (select (select |#memory_int| .cse1) 0) |ULTIMATE.start_main_~data~0#1|)))) [2023-02-16 01:12:30,448 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-02-16 01:12:30,448 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 611 633) the Hoare annotation is: false [2023-02-16 01:12:30,448 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2023-02-16 01:12:30,448 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-02-16 01:12:30,448 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2023-02-16 01:12:30,449 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-02-16 01:12:30,449 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2023-02-16 01:12:30,449 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2023-02-16 01:12:30,449 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-02-16 01:12:30,453 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1] [2023-02-16 01:12:30,455 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 01:12:30,486 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:588) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:348) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:481) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-02-16 01:12:30,490 INFO L158 Benchmark]: Toolchain (without parser) took 232153.30ms. Allocated memory was 157.3MB in the beginning and 903.9MB in the end (delta: 746.6MB). Free memory was 124.0MB in the beginning and 445.8MB in the end (delta: -321.7MB). Peak memory consumption was 548.7MB. Max. memory is 16.1GB. [2023-02-16 01:12:30,490 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 01:12:30,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.21ms. Allocated memory is still 157.3MB. Free memory was 123.5MB in the beginning and 106.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-16 01:12:30,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.00ms. Allocated memory is still 157.3MB. Free memory was 106.3MB in the beginning and 104.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 01:12:30,491 INFO L158 Benchmark]: Boogie Preprocessor took 22.24ms. Allocated memory is still 157.3MB. Free memory was 104.2MB in the beginning and 102.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 01:12:30,492 INFO L158 Benchmark]: RCFGBuilder took 286.61ms. Allocated memory is still 157.3MB. Free memory was 102.7MB in the beginning and 87.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 01:12:30,495 INFO L158 Benchmark]: TraceAbstraction took 231482.28ms. Allocated memory was 157.3MB in the beginning and 903.9MB in the end (delta: 746.6MB). Free memory was 87.0MB in the beginning and 445.8MB in the end (delta: -358.7MB). Peak memory consumption was 513.0MB. Max. memory is 16.1GB. [2023-02-16 01:12:30,496 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.21ms. Allocated memory is still 157.3MB. Free memory was 123.5MB in the beginning and 106.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.00ms. Allocated memory is still 157.3MB. Free memory was 106.3MB in the beginning and 104.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.24ms. Allocated memory is still 157.3MB. Free memory was 104.2MB in the beginning and 102.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.61ms. Allocated memory is still 157.3MB. Free memory was 102.7MB in the beginning and 87.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 231482.28ms. Allocated memory was 157.3MB in the beginning and 903.9MB in the end (delta: 746.6MB). Free memory was 87.0MB in the beginning and 445.8MB in the end (delta: -358.7MB). Peak memory consumption was 513.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 631]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 231.4s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 32.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 62.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2012 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2008 mSDsluCounter, 4406 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 737 IncrementalHoareTripleChecker+Unchecked, 4049 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8594 IncrementalHoareTripleChecker+Invalid, 9538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 357 mSDtfsCounter, 8594 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1343 GetRequests, 517 SyntacticMatches, 30 SemanticMatches, 796 ConstructedPredicates, 53 IntricatePredicates, 0 DeprecatedPredicates, 9510 ImplicationChecksByTransitivity, 59.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=13, InterpolantAutomatonStates: 301, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 108 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 25 PreInvPairs, 44 NumberOfFragments, 5935 HoareAnnotationTreeSize, 25 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 101673 FormulaSimplificationTreeSizeReductionInter, 62.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 129.9s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1224 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1264 ConstructedInterpolants, 68 QuantifiedInterpolants, 34569 SizeOfPredicates, 342 NumberOfNonLiveVariables, 4908 ConjunctsInSsa, 1340 ConjunctsInUnsatCore, 33 InterpolantComputations, 4 PerfectInterpolantSequences, 400/801 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:588) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-16 01:12:30,709 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-02-16 01:12:30,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 01:12:32,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:12:32,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:12:32,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:12:32,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:12:32,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:12:32,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:12:32,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:12:32,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:12:32,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:12:32,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:12:32,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:12:32,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:12:32,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:12:32,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:12:32,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:12:32,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:12:32,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:12:32,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:12:32,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:12:32,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:12:32,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:12:32,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:12:32,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:12:32,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:12:32,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:12:32,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:12:32,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:12:32,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:12:32,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:12:32,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:12:32,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:12:32,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:12:32,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:12:32,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:12:32,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:12:32,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:12:32,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:12:32,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:12:32,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:12:32,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:12:32,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-16 01:12:32,608 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:12:32,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:12:32,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:12:32,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:12:32,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:12:32,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:12:32,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:12:32,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:12:32,611 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:12:32,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:12:32,612 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:12:32,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:12:32,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:12:32,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:12:32,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:12:32,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:12:32,613 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 01:12:32,613 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 01:12:32,614 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 01:12:32,614 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:12:32,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:12:32,614 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:12:32,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:12:32,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:12:32,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:12:32,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:12:32,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:12:32,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:12:32,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:12:32,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:12:32,615 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 01:12:32,616 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 01:12:32,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:12:32,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:12:32,616 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:12:32,616 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:12:32,616 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 01:12:32,617 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:12:32,617 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 ! call(reach_error())) ) 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-16 01:12:32,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:12:32,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:12:32,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:12:32,862 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:12:32,862 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:12:32,863 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-16 01:12:33,919 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:12:34,197 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:12:34,199 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-16 01:12:34,208 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b32fca23/4cb179c16aec4c9ab330eefbb1a84c18/FLAG117f4c167 [2023-02-16 01:12:34,218 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b32fca23/4cb179c16aec4c9ab330eefbb1a84c18 [2023-02-16 01:12:34,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:12:34,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:12:34,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:12:34,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:12:34,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:12:34,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69bc4c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34, skipping insertion in model container [2023-02-16 01:12:34,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:12:34,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:12:34,454 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-16 01:12:34,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:12:34,465 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:12:34,492 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-16 01:12:34,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:12:34,522 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:12:34,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34 WrapperNode [2023-02-16 01:12:34,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:12:34,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:12:34,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:12:34,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:12:34,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,573 INFO L138 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2023-02-16 01:12:34,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:12:34,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:12:34,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:12:34,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:12:34,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,604 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:12:34,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:12:34,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:12:34,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:12:34,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (1/1) ... [2023-02-16 01:12:34,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:12:34,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:12:34,638 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-16 01:12:34,640 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-16 01:12:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-16 01:12:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-16 01:12:34,669 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-16 01:12:34,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 01:12:34,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:12:34,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 01:12:34,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 01:12:34,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 01:12:34,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 01:12:34,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-16 01:12:34,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 01:12:34,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 01:12:34,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:12:34,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:12:34,813 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:12:34,814 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:12:35,041 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:12:35,049 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:12:35,050 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 01:12:35,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:12:35 BoogieIcfgContainer [2023-02-16 01:12:35,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:12:35,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:12:35,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:12:35,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:12:35,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:12:34" (1/3) ... [2023-02-16 01:12:35,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad9f289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:12:35, skipping insertion in model container [2023-02-16 01:12:35,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:12:34" (2/3) ... [2023-02-16 01:12:35,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad9f289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:12:35, skipping insertion in model container [2023-02-16 01:12:35,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:12:35" (3/3) ... [2023-02-16 01:12:35,059 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-02-16 01:12:35,070 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:12:35,071 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:12:35,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:12:35,116 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@499ea0c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:12:35,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:12:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 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-16 01:12:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 01:12:35,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:35,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:35,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:35,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2128592868, now seen corresponding path program 1 times [2023-02-16 01:12:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:12:35,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155032357] [2023-02-16 01:12:35,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:35,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:35,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:12:35,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 01:12:35,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-16 01:12:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:35,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 01:12:35,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:35,261 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-16 01:12:35,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:12:35,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:12:35,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155032357] [2023-02-16 01:12:35,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155032357] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:12:35,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:12:35,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 01:12:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405000564] [2023-02-16 01:12:35,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:12:35,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 01:12:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:12:35,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 01:12:35,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 01:12:35,287 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 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 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-16 01:12:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:12:35,300 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2023-02-16 01:12:35,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 01:12:35,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 17 [2023-02-16 01:12:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:12:35,306 INFO L225 Difference]: With dead ends: 56 [2023-02-16 01:12:35,306 INFO L226 Difference]: Without dead ends: 25 [2023-02-16 01:12:35,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 01:12:35,310 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:12:35,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:12:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-16 01:12:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-16 01:12:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-16 01:12:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-16 01:12:35,347 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2023-02-16 01:12:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:12:35,348 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-16 01:12:35,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-16 01:12:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-16 01:12:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 01:12:35,349 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:35,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:35,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:35,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:35,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1341887012, now seen corresponding path program 1 times [2023-02-16 01:12:35,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:12:35,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641699672] [2023-02-16 01:12:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:35,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:35,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:12:35,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 01:12:35,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-16 01:12:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:35,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 01:12:35,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:35,694 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-16 01:12:35,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:12:35,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:12:35,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641699672] [2023-02-16 01:12:35,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641699672] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:12:35,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:12:35,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 01:12:35,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13131466] [2023-02-16 01:12:35,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:12:35,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 01:12:35,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:12:35,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 01:12:35,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:12:35,697 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 01:12:35,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:12:35,706 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2023-02-16 01:12:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 01:12:35,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2023-02-16 01:12:35,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:12:35,707 INFO L225 Difference]: With dead ends: 48 [2023-02-16 01:12:35,707 INFO L226 Difference]: Without dead ends: 29 [2023-02-16 01:12:35,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-16 01:12:35,722 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:12:35,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:12:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-16 01:12:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-02-16 01:12:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-16 01:12:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-02-16 01:12:35,727 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2023-02-16 01:12:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:12:35,728 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-02-16 01:12:35,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 01:12:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-02-16 01:12:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 01:12:35,728 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:35,728 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:35,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:35,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:35,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:35,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2097266908, now seen corresponding path program 1 times [2023-02-16 01:12:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:12:35,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719779297] [2023-02-16 01:12:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:35,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:35,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:12:35,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 01:12:35,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-16 01:12:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:36,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 01:12:36,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:12:36,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:12:36,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:12:36,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719779297] [2023-02-16 01:12:36,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719779297] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:12:36,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:12:36,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-16 01:12:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521290000] [2023-02-16 01:12:36,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:12:36,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 01:12:36,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:12:36,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 01:12:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-16 01:12:36,218 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-16 01:12:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:12:36,242 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-02-16 01:12:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 01:12:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 26 [2023-02-16 01:12:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:12:36,243 INFO L225 Difference]: With dead ends: 52 [2023-02-16 01:12:36,243 INFO L226 Difference]: Without dead ends: 33 [2023-02-16 01:12:36,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-16 01:12:36,244 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:12:36,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:12:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-16 01:12:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2023-02-16 01:12:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-16 01:12:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-16 01:12:36,248 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2023-02-16 01:12:36,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:12:36,249 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-16 01:12:36,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-16 01:12:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-16 01:12:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 01:12:36,250 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:36,250 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:36,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:36,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:36,464 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:36,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:36,465 INFO L85 PathProgramCache]: Analyzing trace with hash -867054116, now seen corresponding path program 2 times [2023-02-16 01:12:36,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:12:36,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097792952] [2023-02-16 01:12:36,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:12:36,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:36,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:12:36,467 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 01:12:36,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-16 01:12:36,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 01:12:36,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:12:36,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 01:12:36,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:36,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:12:36,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 16 treesize of output 8 [2023-02-16 01:12:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 01:12:36,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:12:36,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:12:36,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097792952] [2023-02-16 01:12:36,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097792952] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:12:36,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:12:36,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 01:12:36,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369406953] [2023-02-16 01:12:36,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:12:36,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 01:12:36,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:12:36,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 01:12:36,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-16 01:12:36,659 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-16 01:12:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:12:36,795 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-02-16 01:12:36,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 01:12:36,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 35 [2023-02-16 01:12:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:12:36,796 INFO L225 Difference]: With dead ends: 43 [2023-02-16 01:12:36,796 INFO L226 Difference]: Without dead ends: 40 [2023-02-16 01:12:36,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-16 01:12:36,797 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:12:36,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 115 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:12:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-16 01:12:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2023-02-16 01:12:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-16 01:12:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-02-16 01:12:36,802 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 35 [2023-02-16 01:12:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:12:36,803 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-02-16 01:12:36,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-16 01:12:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-02-16 01:12:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 01:12:36,803 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:36,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:36,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:37,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:37,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash -867052442, now seen corresponding path program 1 times [2023-02-16 01:12:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:12:37,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507363999] [2023-02-16 01:12:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:37,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:37,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:12:37,019 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 01:12:37,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-16 01:12:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:37,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 01:12:37,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:37,271 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 6 treesize of output 5 [2023-02-16 01:12:37,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-16 01:12:37,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:37,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-16 01:12:37,524 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-16 01:12:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:12:37,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:37,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:12:37,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507363999] [2023-02-16 01:12:37,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507363999] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:12:37,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1018446369] [2023-02-16 01:12:37,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:37,616 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 01:12:37,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 01:12:37,618 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 01:12:37,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-02-16 01:12:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:37,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 01:12:37,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:38,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-16 01:12:38,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:38,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-16 01:12:38,183 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-16 01:12:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:12:38,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:38,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1018446369] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:12:38,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:12:38,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2023-02-16 01:12:38,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716673079] [2023-02-16 01:12:38,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:12:38,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 01:12:38,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:12:38,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 01:12:38,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=425, Unknown=1, NotChecked=0, Total=506 [2023-02-16 01:12:38,249 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 01:12:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:12:38,890 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-02-16 01:12:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 01:12:38,891 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2023-02-16 01:12:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:12:38,892 INFO L225 Difference]: With dead ends: 37 [2023-02-16 01:12:38,892 INFO L226 Difference]: Without dead ends: 30 [2023-02-16 01:12:38,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=708, Unknown=2, NotChecked=0, Total=870 [2023-02-16 01:12:38,893 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 61 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 01:12:38,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 159 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 01:12:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-16 01:12:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-16 01:12:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-16 01:12:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-02-16 01:12:38,898 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 35 [2023-02-16 01:12:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:12:38,898 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-02-16 01:12:38,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 01:12:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-02-16 01:12:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 01:12:38,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:38,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:38,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:39,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:39,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:39,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1386356248, now seen corresponding path program 1 times [2023-02-16 01:12:39,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:12:39,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560041730] [2023-02-16 01:12:39,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:12:39,318 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 01:12:39,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-16 01:12:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:39,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-16 01:12:39,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:39,703 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-16 01:12:39,709 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 6 treesize of output 5 [2023-02-16 01:12:39,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:39,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2023-02-16 01:12:39,868 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-16 01:12:39,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:40,013 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-16 01:12:40,013 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 27 treesize of output 37 [2023-02-16 01:12:40,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:40,026 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-16 01:12:40,233 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-16 01:12:40,431 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:12:40,431 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 37 treesize of output 32 [2023-02-16 01:12:40,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-16 01:12:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:12:40,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:40,583 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2023-02-16 01:12:40,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:12:40,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560041730] [2023-02-16 01:12:40,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560041730] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:12:40,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [542416767] [2023-02-16 01:12:40,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:40,878 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 01:12:40,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 01:12:40,879 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 01:12:40,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-02-16 01:12:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:41,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 01:12:41,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:41,599 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 01:12:41,599 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2023-02-16 01:12:41,617 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 01:12:41,618 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 20 treesize of output 26 [2023-02-16 01:12:41,628 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 01:12:41,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:41,736 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 39 [2023-02-16 01:12:41,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-02-16 01:12:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 01:12:41,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:12:41,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [542416767] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:12:41,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 01:12:41,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [23] total 32 [2023-02-16 01:12:41,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661285236] [2023-02-16 01:12:41,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:12:41,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 01:12:41,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:12:41,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 01:12:41,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1273, Unknown=8, NotChecked=72, Total=1482 [2023-02-16 01:12:41,788 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-16 01:12:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:12:42,136 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-02-16 01:12:42,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 01:12:42,136 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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 38 [2023-02-16 01:12:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:12:42,137 INFO L225 Difference]: With dead ends: 47 [2023-02-16 01:12:42,137 INFO L226 Difference]: Without dead ends: 44 [2023-02-16 01:12:42,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=156, Invalid=1646, Unknown=8, NotChecked=82, Total=1892 [2023-02-16 01:12:42,138 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:12:42,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 120 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:12:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-16 01:12:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2023-02-16 01:12:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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-16 01:12:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-02-16 01:12:42,143 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 38 [2023-02-16 01:12:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:12:42,144 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-02-16 01:12:42,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-16 01:12:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-02-16 01:12:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 01:12:42,145 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:42,145 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:42,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:42,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-16 01:12:42,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:42,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1386357922, now seen corresponding path program 1 times [2023-02-16 01:12:42,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:12:42,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726376569] [2023-02-16 01:12:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:42,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:42,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:12:42,555 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 01:12:42,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-16 01:12:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:42,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-16 01:12:42,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:42,875 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 7 [2023-02-16 01:12:43,034 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-16 01:12:43,040 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 6 treesize of output 5 [2023-02-16 01:12:43,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:43,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-02-16 01:12:43,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-02-16 01:12:43,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-16 01:12:43,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:43,358 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:12:43,359 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 42 [2023-02-16 01:12:43,373 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-16 01:12:43,374 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 17 treesize of output 17 [2023-02-16 01:12:43,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:43,399 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 32 [2023-02-16 01:12:43,499 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 33 treesize of output 21 [2023-02-16 01:12:43,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:43,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2023-02-16 01:12:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:12:43,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:43,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:12:43,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726376569] [2023-02-16 01:12:43,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726376569] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:12:43,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [815525424] [2023-02-16 01:12:43,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:43,777 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 01:12:43,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 01:12:43,778 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 01:12:43,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-16 01:12:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:44,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-16 01:12:44,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:44,279 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 7 [2023-02-16 01:12:44,424 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-16 01:12:44,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:44,642 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 24 treesize of output 15 [2023-02-16 01:12:44,645 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-16 01:12:44,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:44,798 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-16 01:12:44,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:44,825 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:12:44,826 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 30 treesize of output 36 [2023-02-16 01:12:44,838 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-16 01:12:44,838 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 17 treesize of output 17 [2023-02-16 01:12:44,938 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-16 01:12:45,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:45,165 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 32 treesize of output 15 [2023-02-16 01:12:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:12:45,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:45,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [815525424] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:12:45,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:12:45,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2023-02-16 01:12:45,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934422844] [2023-02-16 01:12:45,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:12:45,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-16 01:12:45,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:12:45,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-16 01:12:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1318, Unknown=6, NotChecked=0, Total=1482 [2023-02-16 01:12:45,363 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 28 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:12:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:12:46,925 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2023-02-16 01:12:46,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 01:12:46,925 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 28 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-02-16 01:12:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:12:46,927 INFO L225 Difference]: With dead ends: 41 [2023-02-16 01:12:46,927 INFO L226 Difference]: Without dead ends: 33 [2023-02-16 01:12:46,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=327, Invalid=2213, Unknown=10, NotChecked=0, Total=2550 [2023-02-16 01:12:46,928 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 80 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 13 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 01:12:46,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 301 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 441 Invalid, 16 Unknown, 0 Unchecked, 0.8s Time] [2023-02-16 01:12:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-16 01:12:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-02-16 01:12:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-16 01:12:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-02-16 01:12:46,934 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 38 [2023-02-16 01:12:46,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:12:46,934 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-02-16 01:12:46,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 28 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:12:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-02-16 01:12:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 01:12:46,935 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:46,935 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:46,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:47,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:47,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:47,345 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:47,346 INFO L85 PathProgramCache]: Analyzing trace with hash 403579891, now seen corresponding path program 1 times [2023-02-16 01:12:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:12:47,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984496055] [2023-02-16 01:12:47,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:47,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:47,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:12:47,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 01:12:47,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-16 01:12:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:47,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-16 01:12:47,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:47,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 01:12:47,718 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 6 treesize of output 5 [2023-02-16 01:12:47,721 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-16 01:12:47,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-02-16 01:12:47,877 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 7 treesize of output 5 [2023-02-16 01:12:47,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:47,883 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-16 01:12:48,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:48,009 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 37 treesize of output 35 [2023-02-16 01:12:48,024 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-16 01:12:48,024 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 17 treesize of output 17 [2023-02-16 01:12:48,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:48,036 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:12:48,036 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-16 01:12:48,213 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-16 01:12:48,213 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 36 treesize of output 18 [2023-02-16 01:12:48,300 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 28 treesize of output 23 [2023-02-16 01:12:48,344 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 24 treesize of output 12 [2023-02-16 01:12:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:12:48,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:48,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:12:48,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984496055] [2023-02-16 01:12:48,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984496055] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:12:48,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [589795164] [2023-02-16 01:12:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:48,871 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 01:12:48,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 01:12:48,873 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 01:12:48,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-02-16 01:12:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:49,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-16 01:12:49,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:49,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 01:12:49,588 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-16 01:12:49,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:49,924 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 31 treesize of output 18 [2023-02-16 01:12:49,927 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-16 01:12:50,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:50,096 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:12:50,097 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 37 treesize of output 41 [2023-02-16 01:12:50,116 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-16 01:12:50,117 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 17 treesize of output 17 [2023-02-16 01:12:50,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:50,126 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-16 01:12:50,323 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-16 01:12:50,581 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 01:12:50,582 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 42 treesize of output 47 [2023-02-16 01:12:50,589 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 15 treesize of output 11 [2023-02-16 01:12:50,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:12:50,865 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 65 treesize of output 40 [2023-02-16 01:12:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:12:50,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:51,032 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))) v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 01:12:51,041 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |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|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))) v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 01:12:51,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [589795164] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:12:51,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:12:51,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 38 [2023-02-16 01:12:51,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538367336] [2023-02-16 01:12:51,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:12:51,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 01:12:51,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 01:12:51,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 01:12:51,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1771, Unknown=24, NotChecked=174, Total=2162 [2023-02-16 01:12:51,242 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 01:12:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:12:54,058 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-02-16 01:12:54,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 01:12:54,059 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2023-02-16 01:12:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:12:54,060 INFO L225 Difference]: With dead ends: 50 [2023-02-16 01:12:54,060 INFO L226 Difference]: Without dead ends: 47 [2023-02-16 01:12:54,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=387, Invalid=3015, Unknown=28, NotChecked=230, Total=3660 [2023-02-16 01:12:54,061 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 163 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 18 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-16 01:12:54,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 332 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 557 Invalid, 20 Unknown, 0 Unchecked, 1.3s Time] [2023-02-16 01:12:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-16 01:12:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2023-02-16 01:12:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-16 01:12:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-02-16 01:12:54,068 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 40 [2023-02-16 01:12:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:12:54,068 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-02-16 01:12:54,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 01:12:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-02-16 01:12:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 01:12:54,069 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:12:54,069 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:12:54,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:54,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-16 01:12:54,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:54,476 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:12:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:12:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash 403581565, now seen corresponding path program 1 times [2023-02-16 01:12:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 01:12:54,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688045756] [2023-02-16 01:12:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:54,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 01:12:54,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 01:12:54,479 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 01:12:54,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-16 01:12:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:12:54,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-16 01:12:54,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:12:54,740 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 7 [2023-02-16 01:12:54,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-16 01:12:54,854 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 01:12:54,855 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 27 [2023-02-16 01:12:54,943 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 15 treesize of output 11 [2023-02-16 01:12:55,010 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-16 01:12:55,081 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-16 01:12:55,082 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 26 treesize of output 43 [2023-02-16 01:12:55,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:12:55,163 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 6 treesize of output 5 [2023-02-16 01:12:55,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 01:12:55,448 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:12:55,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 37 [2023-02-16 01:12:55,456 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-16 01:12:55,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 22 treesize of output 16 [2023-02-16 01:12:55,474 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-16 01:12:55,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:55,652 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:12:55,653 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 80 treesize of output 68 [2023-02-16 01:12:55,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:55,668 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-16 01:12:55,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:55,699 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-02-16 01:12:55,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2023-02-16 01:12:55,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:55,734 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-16 01:12:56,284 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 01:12:56,284 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 128 treesize of output 101 [2023-02-16 01:12:56,315 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:12:56,316 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 48 treesize of output 49 [2023-02-16 01:12:56,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:12:56,322 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-16 01:12:56,414 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:12:56,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 34 [2023-02-16 01:12:56,420 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-16 01:12:56,500 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-16 01:12:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:12:56,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:12:56,662 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_729) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_730) |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| v_ArrVal_728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 01:12:56,683 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_729) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-16 01:12:56,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |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|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_729) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-16 01:12:56,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 01:12:56,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688045756] [2023-02-16 01:12:56,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688045756] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:12:56,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [264616105] [2023-02-16 01:12:56,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:12:56,971 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 01:12:56,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 01:12:56,973 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 01:12:56,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process