/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain IntervalDomain -i ../sv-benchmarks/c/list-properties/list_search-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 22:48:21,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 22:48:21,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 22:48:21,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 22:48:21,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 22:48:21,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 22:48:21,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 22:48:21,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 22:48:21,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 22:48:21,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 22:48:21,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 22:48:21,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 22:48:21,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 22:48:21,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 22:48:21,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 22:48:21,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 22:48:21,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 22:48:21,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 22:48:21,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 22:48:21,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 22:48:21,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 22:48:21,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 22:48:21,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 22:48:21,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 22:48:21,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 22:48:21,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 22:48:21,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 22:48:21,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 22:48:21,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 22:48:21,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 22:48:21,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 22:48:21,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 22:48:21,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 22:48:21,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 22:48:21,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 22:48:21,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 22:48:21,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 22:48:21,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 22:48:21,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 22:48:21,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 22:48:21,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 22:48:21,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-03-31 22:48:21,644 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 22:48:21,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 22:48:21,645 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 22:48:21,645 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 22:48:21,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 22:48:21,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 22:48:21,647 INFO L138 SettingsManager]: * User list type=DISABLED [2023-03-31 22:48:21,647 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-03-31 22:48:21,647 INFO L138 SettingsManager]: * Explicit value domain=true [2023-03-31 22:48:21,647 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-03-31 22:48:21,648 INFO L138 SettingsManager]: * Octagon Domain=false [2023-03-31 22:48:21,648 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-03-31 22:48:21,648 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-03-31 22:48:21,648 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-03-31 22:48:21,648 INFO L138 SettingsManager]: * Interval Domain=false [2023-03-31 22:48:21,649 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-03-31 22:48:21,649 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-03-31 22:48:21,649 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-03-31 22:48:21,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 22:48:21,650 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 22:48:21,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 22:48:21,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 22:48:21,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 22:48:21,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 22:48:21,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 22:48:21,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 22:48:21,651 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 22:48:21,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 22:48:21,652 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 22:48:21,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 22:48:21,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 22:48:21,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 22:48:21,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 22:48:21,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 22:48:21,653 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-03-31 22:48:21,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 22:48:21,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 22:48:21,653 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-03-31 22:48:21,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 22:48:21,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 22:48:21,653 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-03-31 22:48:21,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.sifa: Abstract Domain -> IntervalDomain [2023-03-31 22:48:21,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 22:48:21,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 22:48:21,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 22:48:21,946 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 22:48:21,946 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 22:48:21,948 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2023-03-31 22:48:23,129 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 22:48:23,355 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 22:48:23,355 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2023-03-31 22:48:23,377 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caffb75b2/3cfee0e6da104108bf0cd44f9af54593/FLAGcb9a980c2 [2023-03-31 22:48:23,389 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caffb75b2/3cfee0e6da104108bf0cd44f9af54593 [2023-03-31 22:48:23,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 22:48:23,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 22:48:23,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 22:48:23,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 22:48:23,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 22:48:23,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a417be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23, skipping insertion in model container [2023-03-31 22:48:23,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 22:48:23,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 22:48:23,626 WARN L247 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-properties/list_search-1.i[813,826] [2023-03-31 22:48:23,768 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 22:48:23,779 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 22:48:23,792 WARN L247 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-properties/list_search-1.i[813,826] [2023-03-31 22:48:23,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 22:48:23,855 INFO L208 MainTranslator]: Completed translation [2023-03-31 22:48:23,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23 WrapperNode [2023-03-31 22:48:23,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 22:48:23,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 22:48:23,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 22:48:23,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 22:48:23,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 22:48:23,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 22:48:23,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 22:48:23,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 22:48:23,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23" (1/1) ... [2023-03-31 22:48:23,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 22:48:23,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:23,954 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-03-31 22:48:23,973 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-03-31 22:48:23,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 22:48:23,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 22:48:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 22:48:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-03-31 22:48:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-03-31 22:48:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-03-31 22:48:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2023-03-31 22:48:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2023-03-31 22:48:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2023-03-31 22:48:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2023-03-31 22:48:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2023-03-31 22:48:23,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 22:48:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 22:48:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 22:48:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-03-31 22:48:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-03-31 22:48:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 22:48:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 22:48:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-03-31 22:48:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-03-31 22:48:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-03-31 22:48:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-03-31 22:48:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-03-31 22:48:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-03-31 22:48:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-03-31 22:48:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-03-31 22:48:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-03-31 22:48:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-03-31 22:48:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-03-31 22:48:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-03-31 22:48:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-03-31 22:48:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-03-31 22:48:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-03-31 22:48:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-03-31 22:48:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-03-31 22:48:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-03-31 22:48:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-03-31 22:48:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2023-03-31 22:48:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2023-03-31 22:48:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2023-03-31 22:48:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-03-31 22:48:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-03-31 22:48:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-03-31 22:48:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-03-31 22:48:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-03-31 22:48:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-03-31 22:48:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-03-31 22:48:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-03-31 22:48:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-03-31 22:48:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-03-31 22:48:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-03-31 22:48:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-03-31 22:48:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-03-31 22:48:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-03-31 22:48:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-03-31 22:48:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-03-31 22:48:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-03-31 22:48:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-03-31 22:48:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-03-31 22:48:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-03-31 22:48:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-03-31 22:48:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-03-31 22:48:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-03-31 22:48:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-03-31 22:48:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-03-31 22:48:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-03-31 22:48:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-03-31 22:48:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-03-31 22:48:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-03-31 22:48:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-03-31 22:48:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-03-31 22:48:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-03-31 22:48:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-03-31 22:48:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-03-31 22:48:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-03-31 22:48:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-03-31 22:48:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-03-31 22:48:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-03-31 22:48:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-03-31 22:48:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-03-31 22:48:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-03-31 22:48:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-03-31 22:48:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-03-31 22:48:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-03-31 22:48:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-03-31 22:48:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-03-31 22:48:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-03-31 22:48:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-03-31 22:48:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-03-31 22:48:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-03-31 22:48:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-03-31 22:48:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-03-31 22:48:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-03-31 22:48:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-03-31 22:48:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-03-31 22:48:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-03-31 22:48:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-03-31 22:48:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-03-31 22:48:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-03-31 22:48:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-03-31 22:48:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-03-31 22:48:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-03-31 22:48:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-03-31 22:48:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-03-31 22:48:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-03-31 22:48:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2023-03-31 22:48:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 22:48:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-03-31 22:48:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2023-03-31 22:48:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-03-31 22:48:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 22:48:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-03-31 22:48:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 22:48:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 22:48:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 22:48:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 22:48:24,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 22:48:24,298 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 22:48:24,300 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 22:48:24,477 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 22:48:24,552 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 22:48:24,552 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-03-31 22:48:24,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 10:48:24 BoogieIcfgContainer [2023-03-31 22:48:24,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 22:48:24,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 22:48:24,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 22:48:24,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 22:48:24,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 10:48:23" (1/3) ... [2023-03-31 22:48:24,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f14ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 10:48:24, skipping insertion in model container [2023-03-31 22:48:24,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:23" (2/3) ... [2023-03-31 22:48:24,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f14ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 10:48:24, skipping insertion in model container [2023-03-31 22:48:24,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 10:48:24" (3/3) ... [2023-03-31 22:48:24,565 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2023-03-31 22:48:24,608 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 22:48:24,609 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 22:48:24,664 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 22:48:24,670 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=FINITE_AUTOMATA, 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;@54a0a0a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-31 22:48:24,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 22:48:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-03-31 22:48:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-03-31 22:48:24,681 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:24,682 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:24,683 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:24,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:24,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1124056006, now seen corresponding path program 1 times [2023-03-31 22:48:24,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:24,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823092896] [2023-03-31 22:48:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:24,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-31 22:48:25,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:25,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823092896] [2023-03-31 22:48:25,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823092896] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 22:48:25,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 22:48:25,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-31 22:48:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446640161] [2023-03-31 22:48:25,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 22:48:25,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-31 22:48:25,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:25,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-31 22:48:25,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-31 22:48:25,136 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-03-31 22:48:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:25,181 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2023-03-31 22:48:25,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-31 22:48:25,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 31 [2023-03-31 22:48:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:25,191 INFO L225 Difference]: With dead ends: 49 [2023-03-31 22:48:25,192 INFO L226 Difference]: Without dead ends: 27 [2023-03-31 22:48:25,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-31 22:48:25,198 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 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-03-31 22:48:25,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 22:48:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-03-31 22:48:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-03-31 22:48:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-03-31 22:48:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-03-31 22:48:25,233 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 31 [2023-03-31 22:48:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:25,235 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-03-31 22:48:25,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-03-31 22:48:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-03-31 22:48:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-03-31 22:48:25,238 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:25,238 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:25,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 22:48:25,238 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:25,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1916126927, now seen corresponding path program 1 times [2023-03-31 22:48:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:25,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675709456] [2023-03-31 22:48:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:25,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 22:48:26,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675709456] [2023-03-31 22:48:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675709456] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 22:48:26,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 22:48:26,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 22:48:26,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390286189] [2023-03-31 22:48:26,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 22:48:26,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 22:48:26,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:26,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 22:48:26,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-03-31 22:48:26,232 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-03-31 22:48:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:26,621 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2023-03-31 22:48:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-31 22:48:26,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 32 [2023-03-31 22:48:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:26,623 INFO L225 Difference]: With dead ends: 39 [2023-03-31 22:48:26,623 INFO L226 Difference]: Without dead ends: 31 [2023-03-31 22:48:26,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-03-31 22:48:26,625 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:26,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 47 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 22:48:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-03-31 22:48:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-03-31 22:48:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-03-31 22:48:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-03-31 22:48:26,635 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 32 [2023-03-31 22:48:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:26,636 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-03-31 22:48:26,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-03-31 22:48:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-03-31 22:48:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-03-31 22:48:26,637 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:26,638 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:26,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 22:48:26,641 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:26,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash -110976629, now seen corresponding path program 1 times [2023-03-31 22:48:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:26,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025540198] [2023-03-31 22:48:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:26,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-31 22:48:28,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025540198] [2023-03-31 22:48:28,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025540198] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:28,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813251217] [2023-03-31 22:48:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:28,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:28,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:28,062 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-03-31 22:48:28,063 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-03-31 22:48:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:28,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 74 conjunts are in the unsatisfiable core [2023-03-31 22:48:28,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:48:28,407 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-03-31 22:48:28,417 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-03-31 22:48:28,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-03-31 22:48:28,563 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-03-31 22:48:28,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-03-31 22:48:28,574 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-03-31 22:48:28,587 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-03-31 22:48:28,594 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-03-31 22:48:28,716 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-03-31 22:48:28,717 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 18 treesize of output 28 [2023-03-31 22:48:28,740 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-03-31 22:48:28,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-03-31 22:48:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 22:48:29,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:48:30,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:30,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2023-03-31 22:48:30,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:30,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2023-03-31 22:48:30,430 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 9 treesize of output 1 [2023-03-31 22:48:30,442 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 9 treesize of output 1 [2023-03-31 22:48:30,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:30,455 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 35 treesize of output 27 [2023-03-31 22:48:30,467 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-03-31 22:48:30,475 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 55 treesize of output 43 [2023-03-31 22:48:30,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:30,502 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 35 treesize of output 27 [2023-03-31 22:48:30,509 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-03-31 22:48:30,517 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 70 treesize of output 54 [2023-03-31 22:48:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813251217] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1554759158] [2023-03-31 22:48:32,826 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-03-31 22:48:32,826 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:48:32,829 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:48:32,834 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:48:32,834 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:48:32,892 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 31 for LOIs [2023-03-31 22:48:33,510 INFO L197 IcfgInterpreter]: Interpreting procedure search_list with input of size 18 for LOIs [2023-03-31 22:48:33,597 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2023-03-31 22:48:33,605 INFO L197 IcfgInterpreter]: Interpreting procedure insert_list with input of size 25 for LOIs [2023-03-31 22:48:33,626 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-03-31 22:48:33,630 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:48:34,915 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '449#(and (exists ((v_main_~temp~0.base_BEFORE_CALL_1 Int) (v_main_~temp~0.offset_BEFORE_CALL_1 Int)) (not (= (select (select |#memory_int| v_main_~temp~0.base_BEFORE_CALL_1) v_main_~temp~0.offset_BEFORE_CALL_1) 1))) (= ~head~0.offset 0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 22:48:34,916 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:48:34,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 22:48:34,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2023-03-31 22:48:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643079547] [2023-03-31 22:48:34,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 22:48:34,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-03-31 22:48:34,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:34,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-03-31 22:48:34,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2375, Unknown=0, NotChecked=0, Total=2550 [2023-03-31 22:48:34,919 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 25 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 8 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-03-31 22:48:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:35,770 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2023-03-31 22:48:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-03-31 22:48:35,773 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 8 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 34 [2023-03-31 22:48:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:35,774 INFO L225 Difference]: With dead ends: 42 [2023-03-31 22:48:35,774 INFO L226 Difference]: Without dead ends: 34 [2023-03-31 22:48:35,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=321, Invalid=3585, Unknown=0, NotChecked=0, Total=3906 [2023-03-31 22:48:35,777 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:35,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 144 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-03-31 22:48:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-03-31 22:48:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-03-31 22:48:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-03-31 22:48:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-03-31 22:48:35,788 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 34 [2023-03-31 22:48:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:35,788 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-03-31 22:48:35,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 8 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-03-31 22:48:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-03-31 22:48:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-03-31 22:48:35,789 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:35,789 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:35,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-03-31 22:48:35,997 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-03-31 22:48:35,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:35,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:35,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1757658439, now seen corresponding path program 2 times [2023-03-31 22:48:35,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:35,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276274058] [2023-03-31 22:48:35,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:38,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:38,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276274058] [2023-03-31 22:48:38,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276274058] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:38,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113846773] [2023-03-31 22:48:38,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 22:48:38,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:38,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:38,621 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-03-31 22:48:38,649 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-03-31 22:48:39,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-03-31 22:48:39,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 22:48:39,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 110 conjunts are in the unsatisfiable core [2023-03-31 22:48:39,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:48:39,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2023-03-31 22:48:39,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 73 [2023-03-31 22:48:39,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2023-03-31 22:48:39,247 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-03-31 22:48:39,426 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-03-31 22:48:39,431 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-03-31 22:48:39,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-03-31 22:48:39,439 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-03-31 22:48:39,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-03-31 22:48:39,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-03-31 22:48:39,613 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-03-31 22:48:39,613 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 21 treesize of output 29 [2023-03-31 22:48:39,626 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 18 treesize of output 20 [2023-03-31 22:48:39,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-03-31 22:48:39,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-03-31 22:48:39,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:39,927 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 53 treesize of output 43 [2023-03-31 22:48:39,943 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-03-31 22:48:39,943 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 22 treesize of output 36 [2023-03-31 22:48:39,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:39,955 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-03-31 22:48:39,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:39,969 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-03-31 22:48:39,970 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 28 treesize of output 22 [2023-03-31 22:48:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-31 22:48:40,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:48:42,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:42,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 14 [2023-03-31 22:48:42,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:42,063 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 1 case distinctions, treesize of input 12 treesize of output 8 [2023-03-31 22:48:42,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:42,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 14 [2023-03-31 22:48:42,116 INFO L321 Elim1Store]: treesize reduction 23, result has 57.4 percent of original size [2023-03-31 22:48:42,117 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 2 case distinctions, treesize of input 121 treesize of output 120 [2023-03-31 22:48:42,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:42,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 105 [2023-03-31 22:48:42,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:42,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 117 [2023-03-31 22:48:42,350 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 8 treesize of output 6 [2023-03-31 22:48:42,374 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 9 treesize of output 1 [2023-03-31 22:48:42,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:42,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 117 [2023-03-31 22:48:42,444 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 8 treesize of output 6 [2023-03-31 22:48:42,458 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 8 treesize of output 6 [2023-03-31 22:48:42,479 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 9 treesize of output 1 [2023-03-31 22:48:42,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:42,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 79 [2023-03-31 22:48:44,758 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 8 treesize of output 6 [2023-03-31 22:48:44,780 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 8 treesize of output 6 [2023-03-31 22:48:46,939 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~head~0.offset 0)) (.cse23 (= c_~head~0.base 0)) (.cse3 (+ c_~head~0.offset 4))) (let ((.cse13 (forall ((v_~head~0.base_60 Int)) (or (not (= (select |c_#valid| v_~head~0.base_60) 0)) (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18))) (or (not (= .cse85 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (not (= (select v_arrayElimArr_18 4) 0)) (forall ((v_ArrVal_592 (Array Int Int))) (let ((.cse86 (+ (select v_ArrVal_592 4) 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) 0) .cse86) 0)) (not (= (select (select .cse85 0) .cse86) 0))))))))))) (.cse14 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse83 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18))) (or (not (= .cse83 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (not (= (select v_arrayElimArr_18 4) 0)) (forall ((v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (< 2 (let ((.cse84 (+ (select v_ArrVal_592 4) 4))) (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select .cse83 0) .cse84)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) 0) .cse84)))))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) (.cse11 (not (= (select |c_#valid| 0) 0))) (.cse21 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse82 (select v_arrayElimArr_18 4))) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_25) .cse82) .cse3) 0)) (not (= c_~head~0.offset (select v_arrayElimArr_25 4))))) (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18) .cse82) .cse3) 0)) (not (= .cse82 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) (.cse18 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse81 (select v_arrayElimArr_18 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18) .cse81) .cse3) 0)) (not (= .cse81 c_~head~0.base)) (forall ((v_arrayElimArr_22 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_22) .cse81) .cse3) 0)) (not (= c_~head~0.offset (select v_arrayElimArr_22 4)))))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) (.cse19 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse80 (select v_arrayElimArr_18 4))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18) .cse80) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_23) .cse80) .cse3))) (not (= (select v_arrayElimArr_23 4) c_~head~0.offset)))) (not (= .cse80 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) (.cse22 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse79 (select v_arrayElimArr_18 4))) (or (forall ((v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18) .cse79) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_24) .cse79) .cse3))) (not (= c_~head~0.offset (select v_arrayElimArr_24 4))))) (not (= .cse79 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) (.cse20 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse77 (select v_arrayElimArr_18 4))) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse78 (select v_arrayElimArr_21 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_21) .cse77) .cse3) 0)) (not (= c_~head~0.offset .cse78)) (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (not (= (select v_arrayElimArr_20 4) 0)) (not (= v_arrayElimArr_21 (store v_arrayElimArr_20 4 .cse78)))))) (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18) .cse77) .cse3) 0)) (not (= .cse77 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) (.cse24 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse76 (select v_arrayElimArr_18 4))) (or (forall ((v_ArrVal_592 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (forall ((v_arrayElimArr_21 (Array Int Int))) (let ((.cse75 (select v_arrayElimArr_21 4))) (or (not (= c_~head~0.offset .cse75)) (forall ((v_ArrVal_595 (Array Int Int))) (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18) .cse76) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_21) .cse76) .cse3)))) (not (= v_arrayElimArr_21 (store v_arrayElimArr_20 4 .cse75)))))) (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (not (= (select v_arrayElimArr_20 4) 0)))) (not (= .cse76 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) (.cse7 (not .cse23)) (.cse6 (not .cse0))) (and (or .cse0 (and (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18)) (.cse2 (select v_arrayElimArr_18 4))) (or (not (= .cse1 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (not (= (select (select .cse1 .cse2) .cse3) 0)) (not (= .cse2 c_~head~0.base)) (forall ((v_arrayElimArr_22 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_22) .cse2) .cse3) 0)) (not (= c_~head~0.offset (select v_arrayElimArr_22 4)))))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18)) (.cse5 (select v_arrayElimArr_18 4))) (or (not (= .cse4 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select .cse4 .cse5) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_23) .cse5) .cse3))) (not (= (select v_arrayElimArr_23 4) c_~head~0.offset)))) (not (= .cse5 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))))) (or .cse6 .cse7 (and (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18))) (or (not (= .cse8 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (not (= (select v_arrayElimArr_18 4) 0)) (forall ((v_ArrVal_595 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select .cse8 0) 4)))) (or (< 2 (select .cse9 0)) (forall ((v_ArrVal_592 (Array Int Int))) (or (< 2 (select .cse9 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) 0) 4))) (not (= (select v_ArrVal_592 4) 0)))))))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18))) (or (not (= .cse10 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select .cse10 0) 4)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) 0) 4))) (not (= (select v_arrayElimArr_18 4) 0)) (not (= (select v_ArrVal_592 4) 0))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)) (= v_~head~0.base_60 0))) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (or (not (= (store |c_#memory_$Pointer$.base| 0 v_ArrVal_596) (store |c_#memory_$Pointer$.base| 0 v_arrayElimArr_18))) (not (= (select v_arrayElimArr_18 4) 0)))) .cse11) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (not (= (select v_arrayElimArr_18 4) 0)) (forall ((v_~head~0.base_60 Int) (v_ArrVal_596 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18))) (or (not (= .cse12 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (not (= (select (select .cse12 0) 4) 0)) (forall ((v_ArrVal_592 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) 0) 4) 0)) (not (= (select v_ArrVal_592 4) 0)))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))))) .cse13 .cse14)) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18)) (.cse16 (select v_arrayElimArr_18 4))) (or (not (= .cse15 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse17 (select v_arrayElimArr_21 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_21) .cse16) .cse3) 0)) (not (= c_~head~0.offset .cse17)) (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (not (= (select v_arrayElimArr_20 4) 0)) (not (= v_arrayElimArr_21 (store v_arrayElimArr_20 4 .cse17)))))) (not (= (select (select .cse15 .cse16) .cse3) 0)) (not (= .cse16 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (or (and .cse18 .cse19 .cse20 (or (and .cse21 .cse22) .cse23) .cse24) .cse0) (or (and (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18)) (.cse27 (select v_arrayElimArr_18 4))) (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26))) (or (not (= (select v_arrayElimArr_26 4) 0)) (not (= .cse25 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592))) (forall ((v_ArrVal_595 (Array Int Int))) (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select .cse26 .cse27) 4)) (select (select .cse25 .cse27) 4))))))) (not (= .cse26 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (not (= .cse27 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (or (and (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18)) (.cse29 (select v_arrayElimArr_18 4))) (or (not (= .cse28 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (not (= .cse29 c_~head~0.base)) (forall ((v_arrayElimArr_26 (Array Int Int))) (or (not (= (select v_arrayElimArr_26 4) 0)) (forall ((v_ArrVal_595 (Array Int Int))) (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select .cse28 .cse29) 4)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26) .cse29) 4))))))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18)) (.cse31 (select v_arrayElimArr_18 4))) (or (not (= .cse30 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (forall ((v_arrayElimArr_26 (Array Int Int))) (or (not (= (select v_arrayElimArr_26 4) 0)) (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26) .cse31) 4) 0)))) (not (= .cse31 c_~head~0.base)) (not (= (select (select .cse30 .cse31) 4) 0))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) .cse23) (or (and .cse13 .cse14) .cse7) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18)) (.cse34 (select v_arrayElimArr_18 4))) (or (not (= .cse32 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (forall ((v_arrayElimArr_26 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26))) (or (not (= (select v_arrayElimArr_26 4) 0)) (not (= .cse33 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592))) (not (= (select (select .cse33 .cse34) 4) 0))))) (not (= .cse34 c_~head~0.base)) (not (= (select (select .cse32 .cse34) 4) 0))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) .cse6) (or (and (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18)) (.cse36 (select v_arrayElimArr_18 4))) (or (not (= .cse35 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (forall ((v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select .cse35 .cse36) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_24) .cse36) .cse3))) (not (= c_~head~0.offset (select v_arrayElimArr_24 4))))) (not (= .cse36 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18)) (.cse38 (select v_arrayElimArr_18 4))) (or (not (= .cse37 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_25) .cse38) .cse3) 0)) (not (= c_~head~0.offset (select v_arrayElimArr_25 4))))) (not (= (select (select .cse37 .cse38) .cse3) 0)) (not (= .cse38 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) .cse23) (or (and (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_596 (Array Int Int))) (or (forall ((v_ArrVal_592 (Array Int Int))) (let ((.cse39 (+ (select v_ArrVal_592 4) 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) 0) .cse39) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) 0) .cse39) 0))))) (not (= (select v_ArrVal_596 4) 0)))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_596 (Array Int Int))) (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (let ((.cse40 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26))) (or (not (= (select v_arrayElimArr_26 4) 0)) (forall ((v_ArrVal_595 (Array Int Int))) (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) 0) 4)) (select (select .cse40 0) 4)))) (not (= .cse40 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592)))))) (not (= (select v_ArrVal_596 4) 0)))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_596 (Array Int Int))) (or (not (= (select v_ArrVal_596 4) 0)) (forall ((v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (< 2 (let ((.cse41 (+ (select v_ArrVal_592 4) 4))) (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) 0) .cse41)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) 0) .cse41))))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_592 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 (store v_arrayElimArr_20 4 0)) 0) 4) 0)) (not (= (select v_arrayElimArr_20 4) 0)))) (forall ((v_ArrVal_596 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) 0) 4) 0)) (not (= (select v_ArrVal_596 4) 0)))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_596 (Array Int Int))) (or (forall ((v_ArrVal_595 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) 0) 4)))) (or (< 2 (select .cse42 0)) (forall ((v_ArrVal_592 (Array Int Int))) (or (< 2 (select .cse42 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) 0) 4))) (not (= (select v_ArrVal_592 4) 0))))))) (not (= (select v_ArrVal_596 4) 0)))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_596 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) 0) 4) 0)) (not (= (select v_ArrVal_596 4) 0)))) (forall ((v_ArrVal_592 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) 0) 4) 0)) (not (= (select v_ArrVal_592 4) 0)))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_596 (Array Int Int))) (or (not (= (select v_ArrVal_596 4) 0)) (forall ((v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) 0) 4)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) 0) 4))) (not (= (select v_ArrVal_592 4) 0)))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (not (= (select |c_#valid| v_~head~0.base_60) 0)) (forall ((v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) 0) 4)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 (store v_arrayElimArr_20 4 0)) 0) 4))) (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (not (= (select v_ArrVal_596 4) 0)) (not (= (select v_arrayElimArr_20 4) 0)))))) .cse11 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26))) (or (not (= (select v_arrayElimArr_26 4) 0)) (not (= .cse43 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592))) (not (= (select (select .cse43 0) 4) 0))))) (forall ((v_ArrVal_596 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) 0) 4) 0)) (not (= (select v_ArrVal_596 4) 0)))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) .cse6 .cse7) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18)) (.cse46 (select v_arrayElimArr_18 4))) (or (not (= .cse44 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596))) (forall ((v_ArrVal_592 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (forall ((v_arrayElimArr_21 (Array Int Int))) (let ((.cse45 (select v_arrayElimArr_21 4))) (or (not (= c_~head~0.offset .cse45)) (forall ((v_ArrVal_595 (Array Int Int))) (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select .cse44 .cse46) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_21) .cse46) .cse3)))) (not (= v_arrayElimArr_21 (store v_arrayElimArr_20 4 .cse45)))))) (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (not (= (select v_arrayElimArr_20 4) 0)))) (not (= .cse46 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (or (and (or .cse6 (and (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse48 (select v_arrayElimArr_18 4))) (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26))) (or (not (= (select v_arrayElimArr_26 4) 0)) (not (= .cse47 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592))) (not (= (select (select .cse47 .cse48) 4) 0))))) (not (= .cse48 c_~head~0.base)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18) .cse48) 4) 0))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (not (= (select |c_#valid| v_~head~0.base_60) 0)) (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse49 (select v_arrayElimArr_18 4))) (or (not (= .cse49 c_~head~0.base)) (forall ((v_arrayElimArr_26 (Array Int Int))) (or (not (= (select v_arrayElimArr_26 4) 0)) (forall ((v_ArrVal_595 (Array Int Int))) (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18) .cse49) 4)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26) .cse49) 4))))))))))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse50 (select v_arrayElimArr_18 4))) (or (forall ((v_arrayElimArr_26 (Array Int Int))) (or (not (= (select v_arrayElimArr_26 4) 0)) (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26) .cse50) 4) 0)))) (not (= .cse50 c_~head~0.base)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18) .cse50) 4) 0))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse52 (select v_arrayElimArr_18 4))) (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26))) (or (not (= (select v_arrayElimArr_26 4) 0)) (not (= .cse51 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592))) (forall ((v_ArrVal_595 (Array Int Int))) (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_18) .cse52) 4)) (select (select .cse51 .cse52) 4))))))) (not (= .cse52 c_~head~0.base))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))))) .cse21 (or .cse0 (and .cse18 .cse19)) .cse22 .cse20 .cse24) .cse23) (or .cse7 (let ((.cse63 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (< 2 (let ((.cse73 (select v_ArrVal_596 4)) (.cse74 (+ (select v_ArrVal_592 4) 4))) (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse73) .cse74)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) .cse73) .cse74))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) (.cse64 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_592 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse71 (select v_ArrVal_596 4)) (.cse72 (+ (select v_ArrVal_592 4) 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse71) .cse72) 0)) (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) .cse71) .cse72) 0))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))))) (and (or .cse6 (forall ((v_~head~0.base_60 Int) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (< 2 (let ((.cse53 (select v_ArrVal_596 4))) (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse53) 4)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 (store v_arrayElimArr_20 4 0)) .cse53) 4)))) (not (= (select v_arrayElimArr_20 4) 0)) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) (or .cse0 (forall ((v_arrayElimArr_21 (Array Int Int)) (v_~head~0.base_60 Int) (v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse54 (select v_arrayElimArr_21 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_19) 0) .cse3) 0)) (not (= c_~head~0.offset .cse54)) (not (= (select v_arrayElimArr_19 4) 0)) (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (not (= (select v_arrayElimArr_20 4) 0)) (not (= v_arrayElimArr_21 (store v_arrayElimArr_20 4 .cse54))) (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_21) 0) .cse3) 0)) (not (= (select |c_#valid| v_~head~0.base_60) 0)))))) (or .cse6 (forall ((v_~head~0.base_60 Int) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse55 (select v_ArrVal_596 4))) (or (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 (store v_arrayElimArr_20 4 0)) .cse55) 4) 0)) (not (= (select v_arrayElimArr_20 4) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse55) 4) 0)) (not (= (select |c_#valid| v_~head~0.base_60) 0)))))) (or .cse0 (forall ((v_arrayElimArr_21 (Array Int Int)) (v_~head~0.base_60 Int) (v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse56 (select v_arrayElimArr_21 4))) (or (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_19) 0) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_21) 0) .cse3))) (not (= c_~head~0.offset .cse56)) (not (= (select v_arrayElimArr_19 4) 0)) (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (not (= (select v_arrayElimArr_20 4) 0)) (not (= v_arrayElimArr_21 (store v_arrayElimArr_20 4 .cse56))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_592 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (forall ((v_arrayElimArr_21 (Array Int Int))) (let ((.cse58 (select v_arrayElimArr_21 4))) (or (forall ((v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_19))) (or (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select .cse57 0) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_21) 0) .cse3))) (not (= (select v_arrayElimArr_19 4) 0)) (forall ((v_ArrVal_596 (Array Int Int))) (not (= (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse57)))))) (not (= c_~head~0.offset .cse58)) (not (= v_arrayElimArr_21 (store v_arrayElimArr_20 4 .cse58)))))) (not (= (select v_arrayElimArr_20 4) 0)))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_arrayElimArr_20 (Array Int Int))) (or (forall ((v_arrayElimArr_21 (Array Int Int))) (let ((.cse60 (select v_arrayElimArr_21 4))) (or (forall ((v_~head~0.base_60 Int) (v_ArrVal_592 (Array Int Int))) (or (not (= (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_20))) (forall ((v_arrayElimArr_19 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_19))) (or (not (= (select (select .cse59 0) .cse3) 0)) (not (= (select v_arrayElimArr_19 4) 0)) (forall ((v_ArrVal_596 (Array Int Int))) (not (= (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse59)))))) (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_21) 0) .cse3) 0)) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (not (= c_~head~0.offset .cse60)) (not (= v_arrayElimArr_21 (store v_arrayElimArr_20 4 .cse60)))))) (not (= (select v_arrayElimArr_20 4) 0)))) (or (and (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse62 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26))) (or (forall ((v_ArrVal_595 (Array Int Int))) (< 2 (let ((.cse61 (select v_ArrVal_596 4))) (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse61) 4)) (select (select .cse62 .cse61) 4))))) (not (= (select v_arrayElimArr_26 4) 0)) (not (= .cse62 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592)))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) .cse63 .cse64 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_596 (Array Int Int))) (let ((.cse66 (select v_ArrVal_596 4))) (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (let ((.cse65 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_26))) (or (not (= (select v_arrayElimArr_26 4) 0)) (not (= .cse65 (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592))) (not (= (select (select .cse65 .cse66) 4) 0))))) (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse66) 4) 0))))) (not (= (select |c_#valid| v_~head~0.base_60) 0))))) .cse6) (or (and (forall ((v_~head~0.base_60 Int)) (or (forall ((v_arrayElimArr_19 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_19) 0) .cse3) 0)) (not (= (select v_arrayElimArr_19 4) 0)))) (forall ((v_arrayElimArr_22 (Array Int Int))) (or (not (= c_~head~0.offset (select v_arrayElimArr_22 4))) (not (= 0 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_22) 0) .cse3))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (not (= (select |c_#valid| v_~head~0.base_60) 0)) (forall ((v_arrayElimArr_19 (Array Int Int))) (or (not (= (select v_arrayElimArr_19 4) 0)) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 4) c_~head~0.offset)) (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_arrayElimArr_19) 0) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_arrayElimArr_23) 0) .cse3)))))))))) .cse0) (or .cse6 (and (forall ((v_arrayElimCell_24 Int)) (not (= (select |c_#valid| v_arrayElimCell_24) 0))) .cse63 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse68 (select v_ArrVal_596 4))) (let ((.cse67 (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse68) 4)))) (or (< 2 (select .cse67 0)) (forall ((v_ArrVal_592 (Array Int Int))) (or (< 2 (select .cse67 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) .cse68) 4))) (not (= (select v_ArrVal_592 4) 0)))))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_596 (Array Int Int))) (let ((.cse69 (select v_ArrVal_596 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse69) 4) 0)) (forall ((v_ArrVal_592 (Array Int Int))) (or (not (= (select v_ArrVal_592 4) 0)) (not (= (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) .cse69) 4) 0))))))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) .cse64 (forall ((v_~head~0.base_60 Int)) (or (forall ((v_ArrVal_596 (Array Int Int))) (let ((.cse70 (select v_ArrVal_596 4))) (or (forall ((v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (< 2 (select (select (store |c_#memory_int| v_~head~0.base_60 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_60 v_ArrVal_596) .cse70) 4)) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_60 v_ArrVal_592) .cse70) 4))) (not (= (select v_ArrVal_592 4) 0)))) (= v_~head~0.base_60 .cse70)))) (not (= (select |c_#valid| v_~head~0.base_60) 0)))) (forall ((v_arrayElimCell_23 Int)) (not (= (select |c_#valid| v_arrayElimCell_23) 0))))))))))) is different from true [2023-03-31 22:48:46,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113846773] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1682215262] [2023-03-31 22:48:46,956 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-03-31 22:48:46,956 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:48:46,957 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:48:46,957 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:48:46,957 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:48:46,981 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 31 for LOIs [2023-03-31 22:48:47,397 INFO L197 IcfgInterpreter]: Interpreting procedure search_list with input of size 18 for LOIs [2023-03-31 22:48:47,478 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2023-03-31 22:48:47,486 INFO L197 IcfgInterpreter]: Interpreting procedure insert_list with input of size 25 for LOIs [2023-03-31 22:48:47,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-03-31 22:48:47,508 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:48:49,208 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '800#(and (= ~head~0.offset 0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (exists ((v_main_~temp~0.offset_BEFORE_CALL_2 Int) (v_main_~temp~0.base_BEFORE_CALL_2 Int)) (not (= (select (select |#memory_int| v_main_~temp~0.base_BEFORE_CALL_2) v_main_~temp~0.offset_BEFORE_CALL_2) 1))) (= |#NULL.base| 0))' at error location [2023-03-31 22:48:49,208 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:48:49,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 22:48:49,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2023-03-31 22:48:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413944762] [2023-03-31 22:48:49,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 22:48:49,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-03-31 22:48:49,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:49,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-03-31 22:48:49,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2980, Unknown=12, NotChecked=110, Total=3306 [2023-03-31 22:48:49,212 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 31 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 28 states have internal predecessors, (38), 9 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-03-31 22:48:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:52,784 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2023-03-31 22:48:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-03-31 22:48:52,784 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 28 states have internal predecessors, (38), 9 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 36 [2023-03-31 22:48:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:52,785 INFO L225 Difference]: With dead ends: 46 [2023-03-31 22:48:52,785 INFO L226 Difference]: Without dead ends: 38 [2023-03-31 22:48:52,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=452, Invalid=4942, Unknown=12, NotChecked=144, Total=5550 [2023-03-31 22:48:52,788 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 110 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:52,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 113 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 22:48:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-03-31 22:48:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-03-31 22:48:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-03-31 22:48:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2023-03-31 22:48:52,796 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2023-03-31 22:48:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:52,797 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2023-03-31 22:48:52,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 28 states have internal predecessors, (38), 9 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-03-31 22:48:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2023-03-31 22:48:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-03-31 22:48:52,798 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:52,798 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:52,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-03-31 22:48:53,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-03-31 22:48:53,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:53,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2075338237, now seen corresponding path program 3 times [2023-03-31 22:48:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:53,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975369689] [2023-03-31 22:48:53,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:53,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-31 22:48:53,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-03-31 22:48:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-31 22:48:53,181 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-03-31 22:48:53,181 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-03-31 22:48:53,182 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-31 22:48:53,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-31 22:48:53,187 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-03-31 22:48:53,190 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-31 22:48:53,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.03 10:48:53 BoogieIcfgContainer [2023-03-31 22:48:53,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-31 22:48:53,234 INFO L158 Benchmark]: Toolchain (without parser) took 29841.89ms. Allocated memory was 287.3MB in the beginning and 596.6MB in the end (delta: 309.3MB). Free memory was 229.9MB in the beginning and 209.1MB in the end (delta: 20.8MB). Peak memory consumption was 331.5MB. Max. memory is 8.0GB. [2023-03-31 22:48:53,234 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 194.0MB. Free memory was 143.6MB in the beginning and 143.5MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-03-31 22:48:53,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.42ms. Allocated memory is still 287.3MB. Free memory was 229.6MB in the beginning and 212.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-03-31 22:48:53,235 INFO L158 Benchmark]: Boogie Preprocessor took 60.72ms. Allocated memory is still 287.3MB. Free memory was 212.8MB in the beginning and 210.4MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-03-31 22:48:53,235 INFO L158 Benchmark]: RCFGBuilder took 639.82ms. Allocated memory is still 287.3MB. Free memory was 210.0MB in the beginning and 185.2MB in the end (delta: 24.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-03-31 22:48:53,235 INFO L158 Benchmark]: TraceAbstraction took 28674.69ms. Allocated memory was 287.3MB in the beginning and 596.6MB in the end (delta: 309.3MB). Free memory was 184.5MB in the beginning and 209.1MB in the end (delta: -24.7MB). Peak memory consumption was 286.4MB. Max. memory is 8.0GB. [2023-03-31 22:48:53,236 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.16ms. Allocated memory is still 194.0MB. Free memory was 143.6MB in the beginning and 143.5MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.42ms. Allocated memory is still 287.3MB. Free memory was 229.6MB in the beginning and 212.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.72ms. Allocated memory is still 287.3MB. Free memory was 212.8MB in the beginning and 210.4MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 639.82ms. Allocated memory is still 287.3MB. Free memory was 210.0MB in the beginning and 185.2MB in the end (delta: 24.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 28674.69ms. Allocated memory was 287.3MB in the beginning and 596.6MB in the end (delta: 309.3MB). Free memory was 184.5MB in the beginning and 209.1MB in the end (delta: -24.7MB). Peak memory consumption was 286.4MB. Max. memory is 8.0GB. * 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L533] mlist *head; [L554] int i; [L555] mlist *mylist, *temp; VAL [\old(head)={0:0}, head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\old(head)={0:0}, \old(k)=2, head={0:0}, l={63:59}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) [L550] head = l [L551] return 0; [L556] RET insert_list(mylist,2) VAL [\old(head)={0:0}, head={-1:0}, insert_list(mylist,2)=0, mylist={63:59}] [L557] CALL insert_list(mylist,5) VAL [\old(head)={-1:0}, \old(k)=5, head={-1:0}, l={63:59}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head [L550] head = l [L551] return 0; [L557] RET insert_list(mylist,5) VAL [\old(head)={0:0}, head={-5:0}, insert_list(mylist,5)=0, mylist={63:59}] [L558] CALL insert_list(mylist,1) VAL [\old(head)={-5:0}, \old(k)=1, head={-5:0}, l={63:59}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head [L550] head = l [L551] return 0; [L558] RET insert_list(mylist,1) VAL [\old(head)={0:0}, head={-3:0}, insert_list(mylist,1)=0, mylist={63:59}] [L559] CALL insert_list(mylist,3) VAL [\old(head)={-3:0}, \old(k)=3, head={-3:0}, l={63:59}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head [L550] head = l [L551] return 0; [L559] RET insert_list(mylist,3) VAL [\old(head)={0:0}, head={-4:0}, insert_list(mylist,3)=0, mylist={63:59}] [L560] CALL, EXPR search_list(head,2) VAL [\old(head)={0:0}, \old(k)=2, head={-4:0}, l={-4:0}] [L535] l = head VAL [\old(head)={0:0}, \old(k)=2, head={-4:0}, k=2, l={-4:0}, l={-4:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(head)={0:0}, \old(k)=2, head={-4:0}, k=2, l!=((void *)0) && l->key!=k=1, l->key=3, l={-4:0}, l={-4:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(head)={0:0}, \old(k)=2, head={-4:0}, k=2, l!=((void *)0) && l->key!=k=1, l->key=1, l={-3:0}, l={-4:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(head)={0:0}, \old(k)=2, head={-4:0}, k=2, l!=((void *)0) && l->key!=k=1, l->key=5, l={-4:0}, l={-5:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(head)={0:0}, \old(k)=2, head={-4:0}, k=2, l!=((void *)0) && l->key!=k=0, l->key=2, l={-1:0}, l={-4:0}] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; [L560] RET, EXPR search_list(head,2) VAL [\old(head)={0:0}, head={-4:0}, mylist={63:59}, search_list(head,2)={-1:0}] [L560] temp = search_list(head,2) [L561] EXPR temp->key VAL [\old(head)={0:0}, head={-4:0}, mylist={63:59}, temp->key=2, temp={-1:0}] [L561] CALL __VERIFIER_assert(temp->key==1) VAL [\old(cond)=0, \old(head)={0:0}, head={-4:0}] [L14] COND TRUE !(cond) VAL [\old(cond)=0, \old(head)={0:0}, cond=0, head={-4:0}] [L15] reach_error() VAL [\old(cond)=0, \old(head)={0:0}, cond=0, head={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 337 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 262 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1055 IncrementalHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 75 mSDtfsCounter, 1055 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2310 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 197 ConstructedInterpolants, 3 QuantifiedInterpolants, 3851 SizeOfPredicates, 25 NumberOfNonLiveVariables, 867 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 62/88 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 RESULT: Ultimate proved your program to be incorrect! [2023-03-31 22:48:53,273 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 0 Received shutdown request...