/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/heap-data/cart.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:10:54,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:10:54,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:10:55,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:10:55,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:10:55,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:10:55,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:10:55,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:10:55,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:10:55,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:10:55,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:10:55,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:10:55,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:10:55,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:10:55,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:10:55,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:10:55,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:10:55,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:10:55,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:10:55,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:10:55,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:10:55,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:10:55,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:10:55,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:10:55,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:10:55,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:10:55,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:10:55,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:10:55,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:10:55,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:10:55,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:10:55,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:10:55,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:10:55,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:10:55,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:10:55,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:10:55,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:10:55,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:10:55,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:10:55,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:10:55,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:10:55,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 01:10:55,080 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:10:55,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:10:55,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:10:55,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:10:55,082 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:10:55,082 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:10:55,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:10:55,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:10:55,083 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:10:55,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:10:55,083 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:10:55,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:10:55,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:10:55,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:10:55,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:10:55,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:10:55,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:10:55,084 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:10:55,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:10:55,084 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:10:55,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:10:55,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:10:55,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:10:55,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:10:55,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:10:55,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:10:55,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:10:55,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:10:55,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:10:55,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:10:55,085 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:10:55,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:10:55,086 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:10:55,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:10:55,086 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:10:55,086 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-04-02 01:10:55,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:10:55,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:10:55,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:10:55,306 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:10:55,306 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:10:55,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2023-04-02 01:10:56,313 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:10:56,488 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:10:56,488 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2023-04-02 01:10:56,498 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df698336/8f6cea5ccd354b8294b89ce517bd483e/FLAG910ec459b [2023-04-02 01:10:56,525 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df698336/8f6cea5ccd354b8294b89ce517bd483e [2023-04-02 01:10:56,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:10:56,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:10:56,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:10:56,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:10:56,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:10:56,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0c9839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56, skipping insertion in model container [2023-04-02 01:10:56,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:10:56,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:10:56,735 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/heap-data/cart.i[23713,23726] [2023-04-02 01:10:56,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:10:56,748 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:10:56,791 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/heap-data/cart.i[23713,23726] [2023-04-02 01:10:56,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:10:56,822 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:10:56,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56 WrapperNode [2023-04-02 01:10:56,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:10:56,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:10:56,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:10:56,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:10:56,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,872 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:10:56,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:10:56,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:10:56,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:10:56,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56" (1/1) ... [2023-04-02 01:10:56,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:10:56,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:56,915 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-04-02 01:10:56,935 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-04-02 01:10:56,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:10:56,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:10:56,956 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:10:56,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 01:10:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 01:10:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 01:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 01:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 01:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 01:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 01:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 01:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 01:10:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 01:10:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 01:10:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 01:10:56,962 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 01:10:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 01:10:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 01:10:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:10:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 01:10:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:10:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:10:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:10:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:10:57,155 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:10:57,157 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:10:57,326 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:10:57,330 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:10:57,330 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-02 01:10:57,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:10:57 BoogieIcfgContainer [2023-04-02 01:10:57,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:10:57,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:10:57,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:10:57,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:10:57,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:10:56" (1/3) ... [2023-04-02 01:10:57,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138be431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:10:57, skipping insertion in model container [2023-04-02 01:10:57,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:10:56" (2/3) ... [2023-04-02 01:10:57,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138be431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:10:57, skipping insertion in model container [2023-04-02 01:10:57,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:10:57" (3/3) ... [2023-04-02 01:10:57,337 INFO L112 eAbstractionObserver]: Analyzing ICFG cart.i [2023-04-02 01:10:57,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:10:57,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 01:10:57,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:10:57,407 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@485955f7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:10:57,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 01:10:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:10:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-02 01:10:57,415 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:57,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:57,416 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:57,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:57,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1370827132, now seen corresponding path program 1 times [2023-04-02 01:10:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:57,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702003622] [2023-04-02 01:10:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:10:57,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:57,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702003622] [2023-04-02 01:10:57,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702003622] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:10:57,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:10:57,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 01:10:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276548472] [2023-04-02 01:10:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:10:57,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 01:10:57,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:57,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 01:10:57,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 01:10:57,628 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:57,695 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2023-04-02 01:10:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 01:10:57,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-04-02 01:10:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:57,701 INFO L225 Difference]: With dead ends: 40 [2023-04-02 01:10:57,701 INFO L226 Difference]: Without dead ends: 21 [2023-04-02 01:10:57,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 01:10:57,707 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:57,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:10:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-02 01:10:57,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-02 01:10:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-04-02 01:10:57,732 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2023-04-02 01:10:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:57,732 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-04-02 01:10:57,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-04-02 01:10:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-04-02 01:10:57,733 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:57,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:57,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 01:10:57,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:57,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2033574959, now seen corresponding path program 1 times [2023-04-02 01:10:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180314276] [2023-04-02 01:10:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:57,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:10:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180314276] [2023-04-02 01:10:57,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180314276] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:10:57,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:10:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 01:10:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263872774] [2023-04-02 01:10:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:10:57,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 01:10:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 01:10:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:10:57,930 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:58,082 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2023-04-02 01:10:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:10:58,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-04-02 01:10:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:58,085 INFO L225 Difference]: With dead ends: 40 [2023-04-02 01:10:58,085 INFO L226 Difference]: Without dead ends: 25 [2023-04-02 01:10:58,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-04-02 01:10:58,091 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:58,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 17 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:10:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-04-02 01:10:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-04-02 01:10:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-04-02 01:10:58,103 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2023-04-02 01:10:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:58,104 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-04-02 01:10:58,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-04-02 01:10:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-02 01:10:58,104 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:58,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:58,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 01:10:58,105 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:58,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash -857296745, now seen corresponding path program 1 times [2023-04-02 01:10:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641130206] [2023-04-02 01:10:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:58,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:10:58,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:58,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641130206] [2023-04-02 01:10:58,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641130206] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:10:58,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:10:58,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 01:10:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009335502] [2023-04-02 01:10:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:10:58,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 01:10:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 01:10:58,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:10:58,234 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:58,313 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2023-04-02 01:10:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 01:10:58,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-04-02 01:10:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:58,316 INFO L225 Difference]: With dead ends: 40 [2023-04-02 01:10:58,316 INFO L226 Difference]: Without dead ends: 34 [2023-04-02 01:10:58,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:10:58,322 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 67 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:58,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 17 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:10:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-04-02 01:10:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-04-02 01:10:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-04-02 01:10:58,333 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 20 [2023-04-02 01:10:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:58,334 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-04-02 01:10:58,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2023-04-02 01:10:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 01:10:58,335 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:58,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:58,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 01:10:58,335 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:58,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:58,336 INFO L85 PathProgramCache]: Analyzing trace with hash 75495972, now seen corresponding path program 1 times [2023-04-02 01:10:58,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554580886] [2023-04-02 01:10:58,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 01:10:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:58,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554580886] [2023-04-02 01:10:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554580886] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:10:58,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:10:58,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 01:10:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27563713] [2023-04-02 01:10:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:10:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 01:10:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:58,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 01:10:58,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 01:10:58,423 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:10:58,473 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2023-04-02 01:10:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 01:10:58,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-04-02 01:10:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:10:58,476 INFO L225 Difference]: With dead ends: 41 [2023-04-02 01:10:58,476 INFO L226 Difference]: Without dead ends: 31 [2023-04-02 01:10:58,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:10:58,481 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:10:58,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:10:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-02 01:10:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-04-02 01:10:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-04-02 01:10:58,493 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 24 [2023-04-02 01:10:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:10:58,493 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-04-02 01:10:58,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:10:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-04-02 01:10:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 01:10:58,494 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:10:58,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:10:58,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 01:10:58,495 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:10:58,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:10:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash -733850654, now seen corresponding path program 1 times [2023-04-02 01:10:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:10:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031871435] [2023-04-02 01:10:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:10:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:10:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:10:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:10:59,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031871435] [2023-04-02 01:10:59,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031871435] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:10:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154362455] [2023-04-02 01:10:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:10:59,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:10:59,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:10:59,026 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-04-02 01:10:59,050 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-04-02 01:10:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:10:59,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 24 conjunts are in the unsatisfiable core [2023-04-02 01:10:59,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:10:59,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-04-02 01:10:59,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:10:59,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-04-02 01:10:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:10:59,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:10:59,498 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-04-02 01:10:59,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 858 treesize of output 763 [2023-04-02 01:10:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 01:10:59,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154362455] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:10:59,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:10:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 14 [2023-04-02 01:10:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124681776] [2023-04-02 01:10:59,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:10:59,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 01:10:59,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:10:59,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 01:10:59,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:10:59,619 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:00,004 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-04-02 01:11:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 01:11:00,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-04-02 01:11:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:00,006 INFO L225 Difference]: With dead ends: 52 [2023-04-02 01:11:00,006 INFO L226 Difference]: Without dead ends: 50 [2023-04-02 01:11:00,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2023-04-02 01:11:00,007 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 105 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:00,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 51 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:11:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-04-02 01:11:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2023-04-02 01:11:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-04-02 01:11:00,013 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 24 [2023-04-02 01:11:00,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:00,014 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-04-02 01:11:00,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2023-04-02 01:11:00,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-02 01:11:00,014 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:00,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:00,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 01:11:00,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:00,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:00,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:00,222 INFO L85 PathProgramCache]: Analyzing trace with hash -757390979, now seen corresponding path program 1 times [2023-04-02 01:11:00,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:00,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056765320] [2023-04-02 01:11:00,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:00,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:00,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 01:11:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056765320] [2023-04-02 01:11:00,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056765320] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:00,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548613258] [2023-04-02 01:11:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:00,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:00,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:00,375 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-04-02 01:11:00,376 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-04-02 01:11:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:00,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 28 conjunts are in the unsatisfiable core [2023-04-02 01:11:00,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:00,530 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-04-02 01:11:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:00,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:00,676 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 30 treesize of output 26 [2023-04-02 01:11:00,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:00,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2023-04-02 01:11:00,693 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-04-02 01:11:00,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-04-02 01:11:00,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 01:11:00,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548613258] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:00,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:00,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2023-04-02 01:11:00,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035086393] [2023-04-02 01:11:00,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:00,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 01:11:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 01:11:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:11:00,710 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:00,973 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2023-04-02 01:11:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 01:11:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-04-02 01:11:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:00,975 INFO L225 Difference]: With dead ends: 63 [2023-04-02 01:11:00,975 INFO L226 Difference]: Without dead ends: 53 [2023-04-02 01:11:00,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2023-04-02 01:11:00,975 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 118 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:00,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 42 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:11:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-04-02 01:11:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2023-04-02 01:11:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2023-04-02 01:11:00,981 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 27 [2023-04-02 01:11:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:00,981 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2023-04-02 01:11:00,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2023-04-02 01:11:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-02 01:11:00,982 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:00,982 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:00,989 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-04-02 01:11:01,187 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,SelfDestructingSolverStorable5 [2023-04-02 01:11:01,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:01,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:01,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1288349267, now seen corresponding path program 2 times [2023-04-02 01:11:01,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:01,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883194097] [2023-04-02 01:11:01,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:01,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:01,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:01,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883194097] [2023-04-02 01:11:01,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883194097] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:01,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86853016] [2023-04-02 01:11:01,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:11:01,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:01,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:01,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:11:01,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 01:11:01,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:11:01,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:11:01,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjunts are in the unsatisfiable core [2023-04-02 01:11:01,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:01,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:01,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:01,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:01,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86853016] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:01,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2023-04-02 01:11:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052620878] [2023-04-02 01:11:01,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:01,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 01:11:01,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:01,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 01:11:01,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-04-02 01:11:01,704 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:01,841 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2023-04-02 01:11:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 01:11:01,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2023-04-02 01:11:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:01,842 INFO L225 Difference]: With dead ends: 71 [2023-04-02 01:11:01,843 INFO L226 Difference]: Without dead ends: 44 [2023-04-02 01:11:01,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:11:01,843 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:01,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 32 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:11:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-04-02 01:11:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-04-02 01:11:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2023-04-02 01:11:01,849 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 28 [2023-04-02 01:11:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:01,849 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-04-02 01:11:01,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2023-04-02 01:11:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-02 01:11:01,850 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:01,850 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:01,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-02 01:11:02,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:02,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:02,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:02,056 INFO L85 PathProgramCache]: Analyzing trace with hash -395643533, now seen corresponding path program 3 times [2023-04-02 01:11:02,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:02,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201376587] [2023-04-02 01:11:02,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:02,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:02,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:02,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:02,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201376587] [2023-04-02 01:11:02,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201376587] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:02,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710022050] [2023-04-02 01:11:02,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:11:02,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:02,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:02,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:11:02,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 01:11:02,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 01:11:02,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:11:02,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 42 conjunts are in the unsatisfiable core [2023-04-02 01:11:02,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:02,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:11:02,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:02,878 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-04-02 01:11:02,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-04-02 01:11:02,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:02,955 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:11:02,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:02,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2023-04-02 01:11:02,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-04-02 01:11:02,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-04-02 01:11:03,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:03,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-04-02 01:11:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:03,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:03,057 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| c_main_~i~0.base v_ArrVal_386) c_main_~l~0.base))) (< (select .cse0 (+ 8 c_main_~l~0.offset)) (+ (select .cse0 (+ c_main_~l~0.offset 4)) 1)))) is different from false [2023-04-02 01:11:03,107 WARN L839 $PredicateComparison]: unable to prove that (or |c_main_#t~short8| (forall ((v_ArrVal_382 Int) (v_ArrVal_381 Int) (v_ArrVal_386 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_main_~i~0.base)) (.cse2 (+ c_main_~i~0.offset 4))) (or (let ((.cse0 (select (store (store |c_#memory_int| c_main_~i~0.base (store (store .cse1 (+ c_main_~i~0.offset 8) v_ArrVal_382) .cse2 v_ArrVal_381)) (select (select |c_#memory_$Pointer$.base| c_main_~i~0.base) c_main_~i~0.offset) v_ArrVal_386) c_main_~l~0.base))) (< (select .cse0 (+ 8 c_main_~l~0.offset)) (+ (select .cse0 (+ c_main_~l~0.offset 4)) 1))) (< v_ArrVal_381 (select .cse1 .cse2)) (< c_main_~order~0 v_ArrVal_382))))) is different from false [2023-04-02 01:11:03,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:03,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 58 [2023-04-02 01:11:03,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:03,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 87 [2023-04-02 01:11:03,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:03,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 5 [2023-04-02 01:11:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-04-02 01:11:03,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710022050] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:03,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:03,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2023-04-02 01:11:03,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526534857] [2023-04-02 01:11:03,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:03,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 01:11:03,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:03,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 01:11:03,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=199, Unknown=2, NotChecked=58, Total=306 [2023-04-02 01:11:03,283 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:03,702 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2023-04-02 01:11:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 01:11:03,703 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-04-02 01:11:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:03,704 INFO L225 Difference]: With dead ends: 72 [2023-04-02 01:11:03,704 INFO L226 Difference]: Without dead ends: 67 [2023-04-02 01:11:03,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=407, Unknown=3, NotChecked=90, Total=650 [2023-04-02 01:11:03,705 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 246 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:03,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 46 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 287 Invalid, 3 Unknown, 135 Unchecked, 0.2s Time] [2023-04-02 01:11:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-02 01:11:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2023-04-02 01:11:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2023-04-02 01:11:03,713 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 32 [2023-04-02 01:11:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:03,713 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2023-04-02 01:11:03,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2023-04-02 01:11:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-04-02 01:11:03,714 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:03,714 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:03,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-02 01:11:03,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:03,920 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:03,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1222325684, now seen corresponding path program 2 times [2023-04-02 01:11:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:03,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582841534] [2023-04-02 01:11:03,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:03,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:04,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:04,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582841534] [2023-04-02 01:11:04,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582841534] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:04,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391347867] [2023-04-02 01:11:04,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:11:04,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:04,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:04,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:11:04,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 01:11:04,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:11:04,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:11:04,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 63 conjunts are in the unsatisfiable core [2023-04-02 01:11:04,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:04,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:11:04,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:04,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:04,775 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-04-02 01:11:04,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-04-02 01:11:04,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2023-04-02 01:11:04,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-04-02 01:11:04,954 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:11:04,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2023-04-02 01:11:04,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-04-02 01:11:04,966 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 45 treesize of output 29 [2023-04-02 01:11:05,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-04-02 01:11:05,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-02 01:11:05,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:05,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-04-02 01:11:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:05,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:05,209 INFO L321 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2023-04-02 01:11:05,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3696 treesize of output 3071 [2023-04-02 01:11:05,383 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_521 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_main_~i~0.base v_ArrVal_521) c_main_~l~0.base) c_main_~l~0.offset) c_main_~i~0.base)) (forall ((v_ArrVal_519 (Array Int Int))) (= c_main_~i~0.offset (select (select (store |c_#memory_$Pointer$.offset| c_main_~i~0.base v_ArrVal_519) c_main_~l~0.base) c_main_~l~0.offset)))) is different from false [2023-04-02 01:11:05,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:05,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2023-04-02 01:11:05,551 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 30 treesize of output 22 [2023-04-02 01:11:05,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-02 01:11:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-04-02 01:11:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391347867] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:05,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:05,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2023-04-02 01:11:05,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49699569] [2023-04-02 01:11:05,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:05,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-02 01:11:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:05,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-02 01:11:05,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2023-04-02 01:11:05,578 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 25 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:10,608 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2023-04-02 01:11:10,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-02 01:11:10,609 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 25 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-04-02 01:11:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:10,609 INFO L225 Difference]: With dead ends: 66 [2023-04-02 01:11:10,609 INFO L226 Difference]: Without dead ends: 64 [2023-04-02 01:11:10,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=274, Invalid=1133, Unknown=3, NotChecked=72, Total=1482 [2023-04-02 01:11:10,610 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 163 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 10 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:10,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 64 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 485 Invalid, 29 Unknown, 66 Unchecked, 0.5s Time] [2023-04-02 01:11:10,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-02 01:11:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2023-04-02 01:11:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2023-04-02 01:11:10,618 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 35 [2023-04-02 01:11:10,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:10,618 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2023-04-02 01:11:10,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 25 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2023-04-02 01:11:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-02 01:11:10,621 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:10,621 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:10,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 01:11:10,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:10,827 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:10,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1478544062, now seen corresponding path program 4 times [2023-04-02 01:11:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381912067] [2023-04-02 01:11:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:11,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:11,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381912067] [2023-04-02 01:11:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381912067] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460959025] [2023-04-02 01:11:11,388 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 01:11:11,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:11,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:11,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:11:11,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 01:11:11,727 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 01:11:11,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:11:11,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 72 conjunts are in the unsatisfiable core [2023-04-02 01:11:11,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:11,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:11,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:11,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:11:11,803 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-04-02 01:11:11,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:11,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-04-02 01:11:11,818 INFO L321 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-04-02 01:11:11,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 31 [2023-04-02 01:11:11,825 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 8 treesize of output 7 [2023-04-02 01:11:11,832 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-04-02 01:11:11,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-04-02 01:11:11,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2023-04-02 01:11:11,945 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:11:11,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-04-02 01:11:12,011 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:11:12,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 18 [2023-04-02 01:11:12,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-04-02 01:11:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:12,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:12,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:12,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2023-04-02 01:11:12,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:12,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2023-04-02 01:11:12,193 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 6 treesize of output 4 [2023-04-02 01:11:12,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-04-02 01:11:12,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:12,297 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 18 treesize of output 19 [2023-04-02 01:11:12,298 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:11:12,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-04-02 01:11:12,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:12,306 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 24 treesize of output 23 [2023-04-02 01:11:12,309 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 12 treesize of output 10 [2023-04-02 01:11:12,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:11:12,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-04-02 01:11:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460959025] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:12,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2023-04-02 01:11:12,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950957727] [2023-04-02 01:11:12,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:12,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 01:11:12,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:12,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 01:11:12,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-04-02 01:11:12,328 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:12,696 INFO L93 Difference]: Finished difference Result 100 states and 128 transitions. [2023-04-02 01:11:12,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:11:12,696 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-04-02 01:11:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:12,697 INFO L225 Difference]: With dead ends: 100 [2023-04-02 01:11:12,697 INFO L226 Difference]: Without dead ends: 60 [2023-04-02 01:11:12,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2023-04-02 01:11:12,698 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 121 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:12,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 40 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 01:11:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-02 01:11:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-04-02 01:11:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2023-04-02 01:11:12,706 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 36 [2023-04-02 01:11:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:12,706 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2023-04-02 01:11:12,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2023-04-02 01:11:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-02 01:11:12,707 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:12,707 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:12,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-02 01:11:12,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:12,914 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:12,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1535557500, now seen corresponding path program 5 times [2023-04-02 01:11:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:12,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832100853] [2023-04-02 01:11:12,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:12,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:14,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832100853] [2023-04-02 01:11:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832100853] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721220349] [2023-04-02 01:11:14,092 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-02 01:11:14,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:14,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:14,093 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:11:14,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 01:11:16,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-04-02 01:11:16,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:11:16,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 76 conjunts are in the unsatisfiable core [2023-04-02 01:11:16,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:16,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:11:16,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:16,677 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-04-02 01:11:16,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-04-02 01:11:16,723 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-04-02 01:11:16,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:16,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-04-02 01:11:16,735 INFO L321 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2023-04-02 01:11:16,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2023-04-02 01:11:16,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:16,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-02 01:11:16,881 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:11:16,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 36 [2023-04-02 01:11:16,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-04-02 01:11:16,946 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:11:16,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2023-04-02 01:11:16,951 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 18 [2023-04-02 01:11:16,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-04-02 01:11:17,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:17,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-04-02 01:11:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:17,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:17,071 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_890 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| c_main_~i~0.base v_ArrVal_890) c_main_~l~0.base))) (< (select .cse0 (+ 8 c_main_~l~0.offset)) (+ (select .cse0 (+ c_main_~l~0.offset 4)) 1)))) is different from false [2023-04-02 01:11:17,085 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_890 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| c_main_~i~0.base v_ArrVal_889) (select (select |c_#memory_$Pointer$.base| c_main_~i~0.base) c_main_~i~0.offset) v_ArrVal_890) c_main_~l~0.base))) (< (select .cse0 (+ 8 c_main_~l~0.offset)) (+ (select .cse0 (+ c_main_~l~0.offset 4)) 1)))) is different from false [2023-04-02 01:11:17,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:17,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 118 [2023-04-02 01:11:17,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:17,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 241 [2023-04-02 01:11:17,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 174 [2023-04-02 01:11:17,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2023-04-02 01:11:17,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:17,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2023-04-02 01:11:17,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 6 treesize of output 4 [2023-04-02 01:11:17,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:17,527 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 25 treesize of output 24 [2023-04-02 01:11:17,529 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:11:17,530 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 21 treesize of output 9 [2023-04-02 01:11:17,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-04-02 01:11:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-04-02 01:11:17,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721220349] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:17,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:17,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 30 [2023-04-02 01:11:17,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121780443] [2023-04-02 01:11:17,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:17,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-04-02 01:11:17,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:17,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-04-02 01:11:17,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=646, Unknown=5, NotChecked=106, Total=870 [2023-04-02 01:11:17,570 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 30 states, 30 states have (on average 3.066666666666667) internal successors, (92), 29 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:19,499 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2023-04-02 01:11:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-04-02 01:11:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.066666666666667) internal successors, (92), 29 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2023-04-02 01:11:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:19,500 INFO L225 Difference]: With dead ends: 121 [2023-04-02 01:11:19,500 INFO L226 Difference]: Without dead ends: 113 [2023-04-02 01:11:19,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=654, Invalid=2203, Unknown=13, NotChecked=210, Total=3080 [2023-04-02 01:11:19,502 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 490 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 35 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:19,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 72 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 658 Invalid, 16 Unknown, 246 Unchecked, 0.7s Time] [2023-04-02 01:11:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-04-02 01:11:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 67. [2023-04-02 01:11:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2023-04-02 01:11:19,523 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 40 [2023-04-02 01:11:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:19,523 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2023-04-02 01:11:19,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.066666666666667) internal successors, (92), 29 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2023-04-02 01:11:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-04-02 01:11:19,538 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:19,539 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:19,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-04-02 01:11:19,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:19,748 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:19,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash 983512857, now seen corresponding path program 3 times [2023-04-02 01:11:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:19,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438814337] [2023-04-02 01:11:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:19,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:20,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 01:11:20,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438814337] [2023-04-02 01:11:20,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438814337] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418965767] [2023-04-02 01:11:20,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:11:20,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:20,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:20,217 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:11:20,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 01:11:20,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 01:11:20,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:11:20,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 66 conjunts are in the unsatisfiable core [2023-04-02 01:11:20,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:20,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:11:20,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:20,462 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-04-02 01:11:20,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-04-02 01:11:20,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:20,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-04-02 01:11:20,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2023-04-02 01:11:20,632 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:11:20,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2023-04-02 01:11:20,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-04-02 01:11:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 01:11:20,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:22,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:22,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 175 [2023-04-02 01:11:22,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:22,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 133 [2023-04-02 01:11:22,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 105 [2023-04-02 01:11:22,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:22,207 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-04-02 01:11:22,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 182 [2023-04-02 01:11:22,214 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 6 treesize of output 4 [2023-04-02 01:11:22,239 INFO L321 Elim1Store]: treesize reduction 23, result has 53.1 percent of original size [2023-04-02 01:11:22,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 172 [2023-04-02 01:11:22,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:22,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 172 [2023-04-02 01:11:22,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:22,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 130 treesize of output 146 [2023-04-02 01:11:22,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:22,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 145 [2023-04-02 01:11:22,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:22,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 123 [2023-04-02 01:11:22,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:22,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 110 [2023-04-02 01:11:22,975 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 178 treesize of output 172 [2023-04-02 01:11:23,265 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 101 treesize of output 93 [2023-04-02 01:11:23,345 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 6 treesize of output 4 [2023-04-02 01:11:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 01:11:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418965767] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:23,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:23,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2023-04-02 01:11:23,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482346685] [2023-04-02 01:11:23,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:23,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-02 01:11:23,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:23,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-02 01:11:23,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=498, Unknown=19, NotChecked=0, Total=600 [2023-04-02 01:11:23,396 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 25 states, 25 states have (on average 3.28) internal successors, (82), 24 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:32,237 WARN L223 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 64 DAG size of output: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:11:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:34,715 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2023-04-02 01:11:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-02 01:11:34,716 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 24 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2023-04-02 01:11:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:34,716 INFO L225 Difference]: With dead ends: 80 [2023-04-02 01:11:34,716 INFO L226 Difference]: Without dead ends: 67 [2023-04-02 01:11:34,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=321, Invalid=1295, Unknown=24, NotChecked=0, Total=1640 [2023-04-02 01:11:34,717 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 197 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:34,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-02 01:11:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-02 01:11:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2023-04-02 01:11:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2023-04-02 01:11:34,724 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 42 [2023-04-02 01:11:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:34,725 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2023-04-02 01:11:34,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 24 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2023-04-02 01:11:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-02 01:11:34,725 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:34,725 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:34,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-04-02 01:11:34,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-02 01:11:34,931 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:34,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash -92907109, now seen corresponding path program 4 times [2023-04-02 01:11:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:34,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988507910] [2023-04-02 01:11:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:37,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:37,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988507910] [2023-04-02 01:11:37,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988507910] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:37,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640533731] [2023-04-02 01:11:37,552 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 01:11:37,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:37,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:37,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:11:37,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 01:11:37,925 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 01:11:37,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:11:37,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 85 conjunts are in the unsatisfiable core [2023-04-02 01:11:37,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:37,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:11:38,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:38,175 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-04-02 01:11:38,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-04-02 01:11:38,351 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-04-02 01:11:38,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:38,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-04-02 01:11:38,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:38,438 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-04-02 01:11:38,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-04-02 01:11:38,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:11:39,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2023-04-02 01:11:39,231 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:11:39,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2023-04-02 01:11:39,959 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:11:39,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 81 [2023-04-02 01:11:39,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:40,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-04-02 01:11:40,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2023-04-02 01:11:40,544 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-04-02 01:11:40,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 71 [2023-04-02 01:11:40,556 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 34 treesize of output 30 [2023-04-02 01:11:40,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-04-02 01:11:41,266 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:11:41,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 30 [2023-04-02 01:11:41,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-02 01:11:41,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:41,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-04-02 01:11:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:11:41,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:41,830 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1262 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| c_main_~i~0.base v_ArrVal_1264) (select (select (store |c_#memory_$Pointer$.base| c_main_~i~0.base v_ArrVal_1265) c_main_~l~0.base) c_main_~l~0.offset))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| c_main_~i~0.base v_ArrVal_1262) c_main_~l~0.base) c_main_~l~0.offset))) (< (select .cse0 (+ .cse1 8)) (+ (select .cse0 (+ .cse1 4)) 1)))) is different from false [2023-04-02 01:11:41,937 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1260 Int) (v_ArrVal_1257 Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1259 Int) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1258 Int) (v_ArrVal_1262 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_main_~i~0.base)) (.cse1 (+ c_main_~i~0.offset 4))) (or (< v_ArrVal_1258 (select .cse0 .cse1)) (< c_main_~order~0 v_ArrVal_1259) (let ((.cse6 (select |c_#memory_$Pointer$.base| c_main_~i~0.base))) (let ((.cse4 (select .cse6 c_main_~i~0.offset))) (let ((.cse2 (let ((.cse5 (+ c_main_~i~0.offset 8))) (select (store (store |c_#memory_int| c_main_~i~0.base (store (store .cse0 .cse5 v_ArrVal_1259) .cse1 v_ArrVal_1258)) .cse4 v_ArrVal_1264) (select (select (store (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse6 .cse5 v_ArrVal_1260) .cse1 v_ArrVal_1257)) .cse4 v_ArrVal_1265) c_main_~l~0.base) c_main_~l~0.offset)))) (.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~i~0.base v_ArrVal_1254) .cse4 v_ArrVal_1262) c_main_~l~0.base) c_main_~l~0.offset))) (< (select .cse2 (+ 8 .cse3)) (+ (select .cse2 (+ 4 .cse3)) 1)))))))) |c_main_#t~short8|) is different from false [2023-04-02 01:11:41,995 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:41,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 138 [2023-04-02 01:11:42,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:42,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 327 [2023-04-02 01:11:42,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 39 [2023-04-02 01:11:42,592 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| c_main_~i~0.base))) (let ((.cse2 (+ c_main_~i~0.offset 8)) (.cse3 (+ c_main_~i~0.offset 4)) (.cse0 (select .cse1 c_main_~i~0.offset))) (and (forall ((v_ArrVal_1260 Int) (v_ArrVal_1257 Int) (v_ArrVal_1265 (Array Int Int))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse1 .cse2 v_ArrVal_1260) .cse3 v_ArrVal_1257)) .cse0 v_ArrVal_1265) c_main_~l~0.base) c_main_~l~0.offset)))) (forall ((v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1262 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~i~0.base v_ArrVal_1254) .cse0 v_ArrVal_1262) c_main_~l~0.base) c_main_~l~0.offset))) (or (= c_main_~i~0.offset .cse4) (= c_main_~i~0.offset (+ 4 .cse4))))) (forall ((v_ArrVal_1260 Int) (v_ArrVal_1257 Int) (v_ArrVal_1265 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse1 .cse2 v_ArrVal_1260) .cse3 v_ArrVal_1257)) .cse0 v_ArrVal_1265) c_main_~l~0.base) c_main_~l~0.offset) c_main_~i~0.base)) (forall ((v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1262 (Array Int Int))) (= c_main_~i~0.offset (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~i~0.base v_ArrVal_1254) .cse0 v_ArrVal_1262) c_main_~l~0.base) c_main_~l~0.offset)))))) is different from false [2023-04-02 01:11:50,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:50,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 137 [2023-04-02 01:11:50,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:50,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 138 [2023-04-02 01:11:51,011 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 212 treesize of output 200 [2023-04-02 01:11:51,027 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 101 treesize of output 99 [2023-04-02 01:11:51,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2023-04-02 01:11:51,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 4 [2023-04-02 01:11:51,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 4 [2023-04-02 01:11:51,242 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 6 treesize of output 4 [2023-04-02 01:11:51,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:11:51,865 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 98 treesize of output 61 [2023-04-02 01:11:51,872 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:11:51,879 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 57 treesize of output 27 [2023-04-02 01:11:51,894 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 42 treesize of output 36 [2023-04-02 01:11:51,906 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 20 treesize of output 18 [2023-04-02 01:11:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 10 refuted. 4 times theorem prover too weak. 0 trivial. 16 not checked. [2023-04-02 01:11:54,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640533731] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:54,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:54,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2023-04-02 01:11:54,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515938326] [2023-04-02 01:11:54,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:54,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-04-02 01:11:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-04-02 01:11:54,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=649, Unknown=11, NotChecked=162, Total=930 [2023-04-02 01:11:54,395 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:12:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:12:07,070 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2023-04-02 01:12:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-02 01:12:07,078 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2023-04-02 01:12:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:12:07,079 INFO L225 Difference]: With dead ends: 83 [2023-04-02 01:12:07,079 INFO L226 Difference]: Without dead ends: 81 [2023-04-02 01:12:07,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=328, Invalid=1313, Unknown=11, NotChecked=240, Total=1892 [2023-04-02 01:12:07,080 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 183 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-04-02 01:12:07,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 84 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 697 Invalid, 0 Unknown, 253 Unchecked, 5.9s Time] [2023-04-02 01:12:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-04-02 01:12:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2023-04-02 01:12:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:12:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2023-04-02 01:12:07,088 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 43 [2023-04-02 01:12:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:12:07,101 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2023-04-02 01:12:07,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:12:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2023-04-02 01:12:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-04-02 01:12:07,102 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:12:07,102 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:12:07,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 01:12:07,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-02 01:12:07,310 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:12:07,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:12:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2130781519, now seen corresponding path program 6 times [2023-04-02 01:12:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:12:07,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389279035] [2023-04-02 01:12:07,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:07,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:12:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:09,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:12:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:09,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389279035] [2023-04-02 01:12:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389279035] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:12:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731325200] [2023-04-02 01:12:09,190 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-04-02 01:12:09,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:09,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:12:09,205 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:12:09,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-02 01:12:10,226 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-04-02 01:12:10,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:12:10,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 105 conjunts are in the unsatisfiable core [2023-04-02 01:12:10,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:12:10,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:12:10,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:12:10,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:12:10,699 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-04-02 01:12:10,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:10,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-04-02 01:12:10,822 INFO L321 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-04-02 01:12:10,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 31 [2023-04-02 01:12:10,833 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 8 treesize of output 7 [2023-04-02 01:12:10,983 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-04-02 01:12:10,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-04-02 01:12:11,464 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-04-02 01:12:11,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:11,541 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-04-02 01:12:11,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2023-04-02 01:12:11,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:11,674 INFO L321 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2023-04-02 01:12:11,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2023-04-02 01:12:11,686 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 8 treesize of output 7 [2023-04-02 01:12:11,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:11,796 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-04-02 01:12:11,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-04-02 01:12:12,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:12,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2023-04-02 01:12:12,741 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-04-02 01:12:12,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 67 [2023-04-02 01:12:13,247 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-04-02 01:12:13,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 95 [2023-04-02 01:12:13,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:13,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2023-04-02 01:12:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:13,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:12:20,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:20,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 157 treesize of output 192 [2023-04-02 01:12:20,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:20,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 156 [2023-04-02 01:12:20,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 4 [2023-04-02 01:12:20,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 4 [2023-04-02 01:12:21,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:21,942 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 169 treesize of output 164 [2023-04-02 01:12:21,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:21,969 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 157 treesize of output 152 [2023-04-02 01:12:23,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:23,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 114 treesize of output 89 [2023-04-02 01:12:23,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:23,496 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 78 treesize of output 77 [2023-04-02 01:12:23,503 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:23,503 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:23,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:23,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:23,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 8 [2023-04-02 01:12:23,559 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-02 01:12:23,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2023-04-02 01:12:23,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-04-02 01:12:23,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:23,613 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 114 treesize of output 89 [2023-04-02 01:12:23,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:12:23,656 INFO L321 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2023-04-02 01:12:23,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2424 treesize of output 2294 [2023-04-02 01:12:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731325200] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:12:23,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:12:23,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2023-04-02 01:12:23,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246397549] [2023-04-02 01:12:23,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:12:23,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-04-02 01:12:23,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:12:23,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-04-02 01:12:23,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2023-04-02 01:12:23,746 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 22 states, 22 states have (on average 4.0) internal successors, (88), 21 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:12:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:12:30,280 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2023-04-02 01:12:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 01:12:30,282 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.0) internal successors, (88), 21 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-04-02 01:12:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:12:30,282 INFO L225 Difference]: With dead ends: 119 [2023-04-02 01:12:30,282 INFO L226 Difference]: Without dead ends: 98 [2023-04-02 01:12:30,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2023-04-02 01:12:30,283 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 190 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-04-02 01:12:30,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 68 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-04-02 01:12:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-04-02 01:12:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2023-04-02 01:12:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:12:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2023-04-02 01:12:30,301 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 44 [2023-04-02 01:12:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:12:30,302 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2023-04-02 01:12:30,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.0) internal successors, (88), 21 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:12:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2023-04-02 01:12:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-04-02 01:12:30,302 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:12:30,302 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:12:30,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-04-02 01:12:30,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-02 01:12:30,510 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:12:30,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:12:30,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1832839900, now seen corresponding path program 5 times [2023-04-02 01:12:30,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:12:30,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069206727] [2023-04-02 01:12:30,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:30,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:12:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:12:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069206727] [2023-04-02 01:12:33,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069206727] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:12:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154130643] [2023-04-02 01:12:33,831 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-02 01:12:33,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:12:33,833 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:12:33,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-02 01:12:36,902 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-04-02 01:12:36,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:12:36,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 102 conjunts are in the unsatisfiable core [2023-04-02 01:12:36,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:12:36,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:12:37,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:12:37,190 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-04-02 01:12:37,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-04-02 01:12:37,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:12:37,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-04-02 01:12:37,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:37,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-04-02 01:12:37,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:37,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-04-02 01:12:37,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:37,888 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-04-02 01:12:37,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-04-02 01:12:37,949 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 8 treesize of output 7 [2023-04-02 01:12:38,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:38,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2023-04-02 01:12:38,933 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:12:38,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2023-04-02 01:12:39,466 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:12:39,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 75 [2023-04-02 01:12:39,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:39,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2023-04-02 01:12:40,514 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-04-02 01:12:40,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 93 [2023-04-02 01:12:40,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:40,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-04-02 01:12:40,585 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 61 treesize of output 37 [2023-04-02 01:12:41,902 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:12:41,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2023-04-02 01:12:41,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-04-02 01:12:41,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:41,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-04-02 01:12:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:12:41,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:12:43,357 INFO L321 Elim1Store]: treesize reduction 54, result has 50.5 percent of original size [2023-04-02 01:12:43,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7896 treesize of output 6403 [2023-04-02 01:12:43,701 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~i~0.offset 4))) (and (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.offset| c_main_~i~0.base v_ArrVal_1713))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| c_main_~i~0.base v_ArrVal_1714) c_main_~l~0.base) c_main_~l~0.offset)) (select (select .cse2 c_main_~l~0.base) c_main_~l~0.offset))))) (or (= c_main_~i~0.offset .cse0) (= .cse0 .cse1)))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_main_~i~0.base v_ArrVal_1713))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| c_main_~i~0.base v_ArrVal_1714) c_main_~l~0.base) c_main_~l~0.offset)) (select (select .cse4 c_main_~l~0.base) c_main_~l~0.offset))))) (or (= c_main_~i~0.offset .cse3) (= c_main_~i~0.offset (+ .cse3 4))))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| c_main_~i~0.base v_ArrVal_1713)) (.cse8 (store |c_#memory_$Pointer$.base| c_main_~i~0.base v_ArrVal_1714))) (let ((.cse6 (select (select .cse8 c_main_~l~0.base) c_main_~l~0.offset)) (.cse7 (select (select .cse5 c_main_~l~0.base) c_main_~l~0.offset))) (or (= c_main_~i~0.offset (+ (select (select .cse5 .cse6) .cse7) 4)) (= (select (select .cse8 .cse6) .cse7) c_main_~i~0.base))))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| c_main_~i~0.base v_ArrVal_1713)) (.cse12 (store |c_#memory_$Pointer$.base| c_main_~i~0.base v_ArrVal_1714))) (let ((.cse10 (select (select .cse12 c_main_~l~0.base) c_main_~l~0.offset)) (.cse11 (select (select .cse9 c_main_~l~0.base) c_main_~l~0.offset))) (or (= (select (select .cse9 .cse10) .cse11) .cse1) (= (select (select .cse12 .cse10) .cse11) c_main_~i~0.base))))))) is different from false [2023-04-02 01:12:44,142 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| c_main_~i~0.base))) (let ((.cse3 (select |c_#memory_$Pointer$.base| c_main_~i~0.base)) (.cse1 (select .cse7 c_main_~i~0.offset))) (let ((.cse11 (+ .cse1 4)) (.cse4 (+ c_main_~i~0.offset 8)) (.cse5 (+ c_main_~i~0.offset 4)) (.cse6 (select .cse3 c_main_~i~0.offset))) (and (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1711 Int)) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| c_main_~i~0.base (store (store .cse7 .cse4 v_ArrVal_1711) .cse5 v_ArrVal_1709)) .cse6 v_ArrVal_1713))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse3 .cse4 v_ArrVal_1707) .cse5 v_ArrVal_1705)) .cse6 v_ArrVal_1714) c_main_~l~0.base) c_main_~l~0.offset)) (select (select .cse2 c_main_~l~0.base) c_main_~l~0.offset))))) (or (= .cse0 .cse1) (= (+ .cse0 4) .cse1)))) (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1711 Int)) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| c_main_~i~0.base (store (store .cse7 .cse4 v_ArrVal_1711) .cse5 v_ArrVal_1709)) .cse6 v_ArrVal_1713)) (.cse8 (store (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse3 .cse4 v_ArrVal_1707) .cse5 v_ArrVal_1705)) .cse6 v_ArrVal_1714))) (let ((.cse9 (select (select .cse8 c_main_~l~0.base) c_main_~l~0.offset)) (.cse10 (select (select .cse12 c_main_~l~0.base) c_main_~l~0.offset))) (or (= .cse6 (select (select .cse8 .cse9) .cse10)) (= .cse11 (select (select .cse12 .cse9) .cse10)))))) (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1711 Int)) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| c_main_~i~0.base (store (store .cse7 .cse4 v_ArrVal_1711) .cse5 v_ArrVal_1709)) .cse6 v_ArrVal_1713)) (.cse16 (store (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse3 .cse4 v_ArrVal_1707) .cse5 v_ArrVal_1705)) .cse6 v_ArrVal_1714))) (let ((.cse14 (select (select .cse16 c_main_~l~0.base) c_main_~l~0.offset)) (.cse15 (select (select .cse13 c_main_~l~0.base) c_main_~l~0.offset))) (or (= (+ (select (select .cse13 .cse14) .cse15) 4) .cse1) (= .cse6 (select (select .cse16 .cse14) .cse15)))))) (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1711 Int)) (let ((.cse17 (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| c_main_~i~0.base (store (store .cse7 .cse4 v_ArrVal_1711) .cse5 v_ArrVal_1709)) .cse6 v_ArrVal_1713))) (select (select .cse18 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse3 .cse4 v_ArrVal_1707) .cse5 v_ArrVal_1705)) .cse6 v_ArrVal_1714) c_main_~l~0.base) c_main_~l~0.offset)) (select (select .cse18 c_main_~l~0.base) c_main_~l~0.offset))))) (or (= .cse17 .cse1) (= .cse11 .cse17)))))))) is different from false [2023-04-02 01:12:44,764 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$.offset| c_main_~i~0.base))) (let ((.cse16 (select |c_#memory_$Pointer$.base| c_main_~i~0.base)) (.cse1 (select .cse13 c_main_~i~0.offset))) (let ((.cse10 (+ .cse1 8)) (.cse11 (+ .cse1 4)) (.cse8 (select .cse16 c_main_~i~0.offset)) (.cse14 (+ c_main_~i~0.offset 8)) (.cse15 (+ c_main_~i~0.offset 4))) (and (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1696 Int) (v_ArrVal_1699 Int) (v_ArrVal_1701 Int) (v_ArrVal_1711 Int) (v_ArrVal_1703 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse16 .cse14 v_ArrVal_1703) .cse15 v_ArrVal_1696)))) (let ((.cse9 (select .cse7 .cse8)) (.cse12 (store |c_#memory_$Pointer$.offset| c_main_~i~0.base (store (store .cse13 .cse14 v_ArrVal_1699) .cse15 v_ArrVal_1701)))) (let ((.cse0 (select .cse12 .cse8)) (.cse5 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse12 .cse8 (store (store .cse0 .cse10 v_ArrVal_1711) .cse11 v_ArrVal_1709)) .cse5 v_ArrVal_1713)) (.cse6 (store (store .cse7 .cse8 (store (store .cse9 .cse10 v_ArrVal_1707) .cse11 v_ArrVal_1705)) .cse5 v_ArrVal_1714))) (let ((.cse3 (select (select .cse6 c_main_~l~0.base) c_main_~l~0.offset)) (.cse4 (select (select .cse2 c_main_~l~0.base) c_main_~l~0.offset))) (or (= (select .cse0 .cse1) (+ 4 (select (select .cse2 .cse3) .cse4))) (= .cse5 (select (select .cse6 .cse3) .cse4))))))))) (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1696 Int) (v_ArrVal_1699 Int) (v_ArrVal_1701 Int) (v_ArrVal_1711 Int) (v_ArrVal_1703 Int)) (let ((.cse23 (store |c_#memory_$Pointer$.offset| c_main_~i~0.base (store (store .cse13 .cse14 v_ArrVal_1699) .cse15 v_ArrVal_1701)))) (let ((.cse24 (select .cse23 .cse8))) (let ((.cse17 (select .cse24 .cse1)) (.cse18 (let ((.cse20 (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse16 .cse14 v_ArrVal_1703) .cse15 v_ArrVal_1696)))) (let ((.cse21 (select .cse20 .cse8))) (let ((.cse22 (select .cse21 .cse1))) (let ((.cse19 (store (store .cse23 .cse8 (store (store .cse24 .cse10 v_ArrVal_1711) .cse11 v_ArrVal_1709)) .cse22 v_ArrVal_1713))) (select (select .cse19 (select (select (store (store .cse20 .cse8 (store (store .cse21 .cse10 v_ArrVal_1707) .cse11 v_ArrVal_1705)) .cse22 v_ArrVal_1714) c_main_~l~0.base) c_main_~l~0.offset)) (select (select .cse19 c_main_~l~0.base) c_main_~l~0.offset)))))))) (or (= .cse17 .cse18) (= .cse17 (+ 4 .cse18))))))) (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1696 Int) (v_ArrVal_1699 Int) (v_ArrVal_1701 Int) (v_ArrVal_1711 Int) (v_ArrVal_1703 Int)) (let ((.cse31 (store |c_#memory_$Pointer$.offset| c_main_~i~0.base (store (store .cse13 .cse14 v_ArrVal_1699) .cse15 v_ArrVal_1701)))) (let ((.cse32 (select .cse31 .cse8))) (let ((.cse25 (select .cse32 .cse1)) (.cse26 (let ((.cse28 (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse16 .cse14 v_ArrVal_1703) .cse15 v_ArrVal_1696)))) (let ((.cse29 (select .cse28 .cse8))) (let ((.cse30 (select .cse29 .cse1))) (let ((.cse27 (store (store .cse31 .cse8 (store (store .cse32 .cse10 v_ArrVal_1711) .cse11 v_ArrVal_1709)) .cse30 v_ArrVal_1713))) (select (select .cse27 (select (select (store (store .cse28 .cse8 (store (store .cse29 .cse10 v_ArrVal_1707) .cse11 v_ArrVal_1705)) .cse30 v_ArrVal_1714) c_main_~l~0.base) c_main_~l~0.offset)) (select (select .cse27 c_main_~l~0.base) c_main_~l~0.offset)))))))) (or (= .cse25 .cse26) (= (+ .cse25 4) .cse26)))))) (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1696 Int) (v_ArrVal_1699 Int) (v_ArrVal_1701 Int) (v_ArrVal_1711 Int) (v_ArrVal_1703 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.base| c_main_~i~0.base (store (store .cse16 .cse14 v_ArrVal_1703) .cse15 v_ArrVal_1696)))) (let ((.cse40 (select .cse39 .cse8)) (.cse41 (store |c_#memory_$Pointer$.offset| c_main_~i~0.base (store (store .cse13 .cse14 v_ArrVal_1699) .cse15 v_ArrVal_1701)))) (let ((.cse37 (select .cse41 .cse8)) (.cse33 (select .cse40 .cse1))) (let ((.cse38 (store (store .cse41 .cse8 (store (store .cse37 .cse10 v_ArrVal_1711) .cse11 v_ArrVal_1709)) .cse33 v_ArrVal_1713)) (.cse34 (store (store .cse39 .cse8 (store (store .cse40 .cse10 v_ArrVal_1707) .cse11 v_ArrVal_1705)) .cse33 v_ArrVal_1714))) (let ((.cse35 (select (select .cse34 c_main_~l~0.base) c_main_~l~0.offset)) (.cse36 (select (select .cse38 c_main_~l~0.base) c_main_~l~0.offset))) (or (= .cse33 (select (select .cse34 .cse35) .cse36)) (= (+ (select .cse37 .cse1) 4) (select (select .cse38 .cse35) .cse36))))))))))))) is different from false [2023-04-02 01:12:45,823 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$.offset| c_main_~l~0.base))) (let ((.cse12 (select |c_#memory_$Pointer$.base| c_main_~l~0.base)) (.cse3 (select .cse15 c_main_~l~0.offset))) (let ((.cse8 (+ 8 .cse3)) (.cse9 (+ 4 .cse3)) (.cse6 (select .cse12 c_main_~l~0.offset)) (.cse13 (+ 8 c_main_~l~0.offset)) (.cse14 (+ c_main_~l~0.offset 4))) (and (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1696 Int) (v_ArrVal_1699 Int) (v_ArrVal_1701 Int) (v_ArrVal_1711 Int) (v_ArrVal_1703 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| c_main_~l~0.base (store (store .cse15 .cse13 v_ArrVal_1699) .cse14 v_ArrVal_1701)))) (let ((.cse2 (select .cse11 .cse6))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_main_~l~0.base (store (store .cse12 .cse13 v_ArrVal_1703) .cse14 v_ArrVal_1696)))) (let ((.cse7 (select .cse5 .cse6))) (let ((.cse10 (select .cse7 .cse3))) (let ((.cse4 (store (store .cse11 .cse6 (store (store .cse2 .cse8 v_ArrVal_1711) .cse9 v_ArrVal_1709)) .cse10 v_ArrVal_1713))) (select (select .cse4 (select (select (store (store .cse5 .cse6 (store (store .cse7 .cse8 v_ArrVal_1707) .cse9 v_ArrVal_1705)) .cse10 v_ArrVal_1714) c_main_~l~0.base) c_main_~l~0.offset)) (select (select .cse4 c_main_~l~0.base) c_main_~l~0.offset))))))) (.cse0 (select .cse2 .cse3))) (or (= .cse0 .cse1) (= (+ .cse1 4) .cse0)))))) (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1696 Int) (v_ArrVal_1699 Int) (v_ArrVal_1701 Int) (v_ArrVal_1711 Int) (v_ArrVal_1703 Int)) (let ((.cse22 (store |c_#memory_$Pointer$.base| c_main_~l~0.base (store (store .cse12 .cse13 v_ArrVal_1703) .cse14 v_ArrVal_1696)))) (let ((.cse23 (select .cse22 .cse6)) (.cse24 (store |c_#memory_$Pointer$.offset| c_main_~l~0.base (store (store .cse15 .cse13 v_ArrVal_1699) .cse14 v_ArrVal_1701)))) (let ((.cse19 (select .cse24 .cse6)) (.cse21 (select .cse23 .cse3))) (let ((.cse16 (store (store .cse24 .cse6 (store (store .cse19 .cse8 v_ArrVal_1711) .cse9 v_ArrVal_1709)) .cse21 v_ArrVal_1713)) (.cse20 (store (store .cse22 .cse6 (store (store .cse23 .cse8 v_ArrVal_1707) .cse9 v_ArrVal_1705)) .cse21 v_ArrVal_1714))) (let ((.cse17 (select (select .cse20 c_main_~l~0.base) c_main_~l~0.offset)) (.cse18 (select (select .cse16 c_main_~l~0.base) c_main_~l~0.offset))) (or (= (+ (select (select .cse16 .cse17) .cse18) 4) (select .cse19 .cse3)) (= (select (select .cse20 .cse17) .cse18) .cse21)))))))) (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1696 Int) (v_ArrVal_1699 Int) (v_ArrVal_1701 Int) (v_ArrVal_1711 Int) (v_ArrVal_1703 Int)) (let ((.cse31 (store |c_#memory_$Pointer$.offset| c_main_~l~0.base (store (store .cse15 .cse13 v_ArrVal_1699) .cse14 v_ArrVal_1701)))) (let ((.cse32 (select .cse31 .cse6))) (let ((.cse25 (select .cse32 .cse3)) (.cse26 (let ((.cse28 (store |c_#memory_$Pointer$.base| c_main_~l~0.base (store (store .cse12 .cse13 v_ArrVal_1703) .cse14 v_ArrVal_1696)))) (let ((.cse29 (select .cse28 .cse6))) (let ((.cse30 (select .cse29 .cse3))) (let ((.cse27 (store (store .cse31 .cse6 (store (store .cse32 .cse8 v_ArrVal_1711) .cse9 v_ArrVal_1709)) .cse30 v_ArrVal_1713))) (select (select .cse27 (select (select (store (store .cse28 .cse6 (store (store .cse29 .cse8 v_ArrVal_1707) .cse9 v_ArrVal_1705)) .cse30 v_ArrVal_1714) c_main_~l~0.base) c_main_~l~0.offset)) (select (select .cse27 c_main_~l~0.base) c_main_~l~0.offset)))))))) (or (= .cse25 .cse26) (= (+ .cse25 4) .cse26)))))) (forall ((v_ArrVal_1705 Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1709 Int) (v_ArrVal_1696 Int) (v_ArrVal_1699 Int) (v_ArrVal_1701 Int) (v_ArrVal_1711 Int) (v_ArrVal_1703 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.base| c_main_~l~0.base (store (store .cse12 .cse13 v_ArrVal_1703) .cse14 v_ArrVal_1696)))) (let ((.cse40 (select .cse39 .cse6)) (.cse41 (store |c_#memory_$Pointer$.offset| c_main_~l~0.base (store (store .cse15 .cse13 v_ArrVal_1699) .cse14 v_ArrVal_1701)))) (let ((.cse33 (select .cse41 .cse6)) (.cse38 (select .cse40 .cse3))) (let ((.cse34 (store (store .cse41 .cse6 (store (store .cse33 .cse8 v_ArrVal_1711) .cse9 v_ArrVal_1709)) .cse38 v_ArrVal_1713)) (.cse37 (store (store .cse39 .cse6 (store (store .cse40 .cse8 v_ArrVal_1707) .cse9 v_ArrVal_1705)) .cse38 v_ArrVal_1714))) (let ((.cse35 (select (select .cse37 c_main_~l~0.base) c_main_~l~0.offset)) (.cse36 (select (select .cse34 c_main_~l~0.base) c_main_~l~0.offset))) (or (= (+ (select .cse33 .cse3) 4) (select (select .cse34 .cse35) .cse36)) (= (select (select .cse37 .cse35) .cse36) .cse38)))))))))))) is different from false [2023-04-02 01:12:57,011 WARN L223 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-04-02 01:12:57,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:57,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 1653 treesize of output 1624 [2023-04-02 01:13:25,406 WARN L223 SmtUtils]: Spent 28.35s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-04-02 01:13:25,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:25,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 1347 treesize of output 1210 [2023-04-02 01:13:25,911 INFO L217 Elim1Store]: Index analysis took 235 ms [2023-04-02 01:13:25,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 109 treesize of output 197 [2023-04-02 01:13:26,274 INFO L217 Elim1Store]: Index analysis took 223 ms [2023-04-02 01:13:26,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 109 treesize of output 197 [2023-04-02 01:13:26,591 INFO L217 Elim1Store]: Index analysis took 217 ms [2023-04-02 01:13:26,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 109 treesize of output 197 [2023-04-02 01:13:26,942 INFO L217 Elim1Store]: Index analysis took 103 ms [2023-04-02 01:13:26,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 75 treesize of output 69 [2023-04-02 01:13:27,121 INFO L217 Elim1Store]: Index analysis took 103 ms [2023-04-02 01:13:27,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 75 treesize of output 69 [2023-04-02 01:13:27,366 INFO L217 Elim1Store]: Index analysis took 107 ms [2023-04-02 01:13:27,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 75 treesize of output 69 [2023-04-02 01:13:27,999 INFO L217 Elim1Store]: Index analysis took 111 ms [2023-04-02 01:13:28,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 75 treesize of output 69 [2023-04-02 01:13:28,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 75 treesize of output 69 [2023-04-02 01:13:28,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 75 treesize of output 69 [2023-04-02 01:13:29,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 4 [2023-04-02 01:13:29,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 4 [2023-04-02 01:13:30,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 4 [2023-04-02 01:13:34,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:34,732 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 1561 treesize of output 1298 [2023-04-02 01:13:35,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:35,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 227584 treesize of output 215768 [2023-04-02 01:13:36,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:36,141 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 23542 treesize of output 14550 [2023-04-02 01:13:36,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:36,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 125413 treesize of output 116675 [2023-04-02 01:13:38,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:38,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 3799 treesize of output 3726 [2023-04-02 01:13:38,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:38,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4752 treesize of output 4566 [2023-04-02 01:13:39,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:39,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3645 treesize of output 3644 [2023-04-02 01:13:39,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:39,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4796 treesize of output 4582 [2023-04-02 01:13:40,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:40,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 3567 treesize of output 3472 [2023-04-02 01:13:40,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:40,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 3459 treesize of output 3386 [2023-04-02 01:13:41,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:41,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4360 treesize of output 4174 [2023-04-02 01:13:41,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:41,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3317 treesize of output 3316 [2023-04-02 01:13:41,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:41,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4288 treesize of output 4134 [2023-04-02 01:13:42,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:42,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 3251 treesize of output 3156 [2023-04-02 01:13:42,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:42,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3275 treesize of output 3266 [2023-04-02 01:13:43,217 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 4106 treesize of output 3942 [2023-04-02 01:13:43,402 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 3942 treesize of output 3840 [2023-04-02 01:13:43,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3940 treesize of output 3776 [2023-04-02 01:13:43,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:43,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3095 treesize of output 3086 [2023-04-02 01:13:44,310 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 3846 treesize of output 3704