/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/forester-heap/dll-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 00:53:33,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 00:53:33,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 00:53:33,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 00:53:33,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 00:53:33,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 00:53:33,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 00:53:33,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 00:53:33,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 00:53:33,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 00:53:33,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 00:53:33,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 00:53:33,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 00:53:33,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 00:53:33,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 00:53:33,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 00:53:33,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 00:53:33,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 00:53:33,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 00:53:33,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 00:53:33,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 00:53:33,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 00:53:33,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 00:53:33,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 00:53:33,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 00:53:33,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 00:53:33,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 00:53:33,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 00:53:33,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 00:53:33,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 00:53:33,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 00:53:33,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 00:53:33,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 00:53:33,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 00:53:33,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 00:53:33,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 00:53:33,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 00:53:33,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 00:53:33,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 00:53:33,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 00:53:33,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 00:53:33,612 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 00:53:33,640 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 00:53:33,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 00:53:33,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 00:53:33,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 00:53:33,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 00:53:33,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 00:53:33,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 00:53:33,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 00:53:33,643 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 00:53:33,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 00:53:33,644 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 00:53:33,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 00:53:33,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 00:53:33,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 00:53:33,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 00:53:33,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 00:53:33,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 00:53:33,645 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 00:53:33,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 00:53:33,645 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 00:53:33,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 00:53:33,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 00:53:33,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 00:53:33,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 00:53:33,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 00:53:33,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 00:53:33,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 00:53:33,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 00:53:33,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 00:53:33,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 00:53:33,647 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 00:53:33,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 00:53:33,647 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 00:53:33,647 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 00:53:33,647 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 00:53:33,647 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 00:53:33,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 00:53:33,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 00:53:33,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 00:53:33,900 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 00:53:33,900 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 00:53:33,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-04-02 00:53:35,212 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 00:53:35,476 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 00:53:35,476 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-04-02 00:53:35,489 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6c3e60f/b953786137094aa5af16b2b53fd7e3fe/FLAG8f99a61c0 [2023-04-02 00:53:35,503 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6c3e60f/b953786137094aa5af16b2b53fd7e3fe [2023-04-02 00:53:35,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 00:53:35,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 00:53:35,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 00:53:35,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 00:53:35,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 00:53:35,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c02bcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35, skipping insertion in model container [2023-04-02 00:53:35,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 00:53:35,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 00:53:35,761 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/forester-heap/dll-optional-1.i[22753,22766] [2023-04-02 00:53:35,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 00:53:35,778 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 00:53:35,825 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/forester-heap/dll-optional-1.i[22753,22766] [2023-04-02 00:53:35,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 00:53:35,862 INFO L208 MainTranslator]: Completed translation [2023-04-02 00:53:35,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35 WrapperNode [2023-04-02 00:53:35,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 00:53:35,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 00:53:35,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 00:53:35,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 00:53:35,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,933 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 00:53:35,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 00:53:35,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 00:53:35,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 00:53:35,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35" (1/1) ... [2023-04-02 00:53:35,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 00:53:35,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:53:35,981 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 00:53:36,002 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 00:53:36,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 00:53:36,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 00:53:36,027 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 00:53:36,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 00:53:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 00:53:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 00:53:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 00:53:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 00:53:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 00:53:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 00:53:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 00:53:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 00:53:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 00:53:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 00:53:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 00:53:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 00:53:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 00:53:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 00:53:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 00:53:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 00:53:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 00:53:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 00:53:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 00:53:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 00:53:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 00:53:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 00:53:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 00:53:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 00:53:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 00:53:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 00:53:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 00:53:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 00:53:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 00:53:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 00:53:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 00:53:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 00:53:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 00:53:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 00:53:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 00:53:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 00:53:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 00:53:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 00:53:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 00:53:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 00:53:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 00:53:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 00:53:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 00:53:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 00:53:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 00:53:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 00:53:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 00:53:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 00:53:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 00:53:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 00:53:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 00:53:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 00:53:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 00:53:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 00:53:36,036 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 00:53:36,036 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 00:53:36,036 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 00:53:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 00:53:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 00:53:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 00:53:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 00:53:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 00:53:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 00:53:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 00:53:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 00:53:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 00:53:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 00:53:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 00:53:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 00:53:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 00:53:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 00:53:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 00:53:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 00:53:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 00:53:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 00:53:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 00:53:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 00:53:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 00:53:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 00:53:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 00:53:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 00:53:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 00:53:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 00:53:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 00:53:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 00:53:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 00:53:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 00:53:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 00:53:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 00:53:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 00:53:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 00:53:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 00:53:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 00:53:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 00:53:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 00:53:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 00:53:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 00:53:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 00:53:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 00:53:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 00:53:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 00:53:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 00:53:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 00:53:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 00:53:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 00:53:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 00:53:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 00:53:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 00:53:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 00:53:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 00:53:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 00:53:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 00:53:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 00:53:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 00:53:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 00:53:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 00:53:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 00:53:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 00:53:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 00:53:36,232 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 00:53:36,233 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 00:53:36,537 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 00:53:36,548 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 00:53:36,548 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-04-02 00:53:36,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 12:53:36 BoogieIcfgContainer [2023-04-02 00:53:36,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 00:53:36,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 00:53:36,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 00:53:36,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 00:53:36,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 12:53:35" (1/3) ... [2023-04-02 00:53:36,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3f3a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 12:53:36, skipping insertion in model container [2023-04-02 00:53:36,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:53:35" (2/3) ... [2023-04-02 00:53:36,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3f3a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 12:53:36, skipping insertion in model container [2023-04-02 00:53:36,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 12:53:36" (3/3) ... [2023-04-02 00:53:36,557 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2023-04-02 00:53:36,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 00:53:36,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 00:53:36,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 00:53:36,627 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;@6a547c59, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 00:53:36,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 00:53:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 30 states have internal predecessors, (47), 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 00:53:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-02 00:53:36,638 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:53:36,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:53:36,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:53:36,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:53:36,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2140702452, now seen corresponding path program 1 times [2023-04-02 00:53:36,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:53:36,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9603808] [2023-04-02 00:53:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:53:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:36,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:53:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:36,890 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 00:53:36,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:53:36,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9603808] [2023-04-02 00:53:36,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9603808] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:53:36,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:53:36,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 00:53:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146276568] [2023-04-02 00:53:36,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:53:36,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 00:53:36,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:53:36,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 00:53:36,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 00:53:36,924 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 30 states have internal predecessors, (47), 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 00:53:37,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:53:37,047 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2023-04-02 00:53:37,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 00:53:37,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 19 [2023-04-02 00:53:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:53:37,060 INFO L225 Difference]: With dead ends: 57 [2023-04-02 00:53:37,060 INFO L226 Difference]: Without dead ends: 26 [2023-04-02 00:53:37,063 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 00:53:37,069 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 00:53:37,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 10 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 00:53:37,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-04-02 00:53:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-04-02 00:53:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 00:53:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-04-02 00:53:37,106 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2023-04-02 00:53:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:53:37,107 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-04-02 00:53:37,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 00:53:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-04-02 00:53:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-02 00:53:37,108 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:53:37,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:53:37,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 00:53:37,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:53:37,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:53:37,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1062682451, now seen corresponding path program 1 times [2023-04-02 00:53:37,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:53:37,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92292640] [2023-04-02 00:53:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:37,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:53:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:53:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:37,225 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 00:53:37,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:53:37,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92292640] [2023-04-02 00:53:37,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92292640] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:53:37,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:53:37,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 00:53:37,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857014509] [2023-04-02 00:53:37,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:53:37,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 00:53:37,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:53:37,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 00:53:37,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 00:53:37,229 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 00:53:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:53:37,328 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2023-04-02 00:53:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 00:53:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 00:53:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:53:37,330 INFO L225 Difference]: With dead ends: 29 [2023-04-02 00:53:37,331 INFO L226 Difference]: Without dead ends: 27 [2023-04-02 00:53:37,336 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 00:53:37,338 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 00:53:37,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 00:53:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-04-02 00:53:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-04-02 00:53:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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 00:53:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-04-02 00:53:37,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2023-04-02 00:53:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:53:37,350 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-04-02 00:53:37,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 00:53:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-04-02 00:53:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-02 00:53:37,352 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:53:37,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:53:37,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 00:53:37,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:53:37,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:53:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1062680529, now seen corresponding path program 1 times [2023-04-02 00:53:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:53:37,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501759578] [2023-04-02 00:53:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:53:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:37,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:53:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:37,523 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 00:53:37,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:53:37,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501759578] [2023-04-02 00:53:37,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501759578] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:53:37,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:53:37,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 00:53:37,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825864377] [2023-04-02 00:53:37,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:53:37,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 00:53:37,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:53:37,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 00:53:37,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 00:53:37,526 INFO L87 Difference]: Start difference. First operand 27 states and 35 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 00:53:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:53:37,669 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2023-04-02 00:53:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 00:53:37,669 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 00:53:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:53:37,670 INFO L225 Difference]: With dead ends: 50 [2023-04-02 00:53:37,670 INFO L226 Difference]: Without dead ends: 37 [2023-04-02 00:53:37,671 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 00:53:37,672 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 00:53:37,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 17 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 00:53:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-02 00:53:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2023-04-02 00:53:37,677 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 00:53:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-04-02 00:53:37,678 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 20 [2023-04-02 00:53:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:53:37,678 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-04-02 00:53:37,678 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 00:53:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2023-04-02 00:53:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-02 00:53:37,679 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:53:37,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:53:37,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 00:53:37,680 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:53:37,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:53:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1060833487, now seen corresponding path program 1 times [2023-04-02 00:53:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:53:37,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179273957] [2023-04-02 00:53:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:37,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:53:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:37,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:53:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:37,969 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 00:53:37,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:53:37,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179273957] [2023-04-02 00:53:37,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179273957] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:53:37,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:53:37,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 00:53:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098088769] [2023-04-02 00:53:37,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:53:37,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 00:53:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:53:37,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 00:53:37,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-02 00:53:37,972 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 00:53:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:53:38,242 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2023-04-02 00:53:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 00:53:38,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 00:53:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:53:38,244 INFO L225 Difference]: With dead ends: 76 [2023-04-02 00:53:38,244 INFO L226 Difference]: Without dead ends: 61 [2023-04-02 00:53:38,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-04-02 00:53:38,251 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 135 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 00:53:38,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 24 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 00:53:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-02 00:53:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 36. [2023-04-02 00:53:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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 00:53:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2023-04-02 00:53:38,263 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 20 [2023-04-02 00:53:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:53:38,263 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2023-04-02 00:53:38,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 00:53:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2023-04-02 00:53:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-02 00:53:38,264 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:53:38,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:53:38,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 00:53:38,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:53:38,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:53:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1457279405, now seen corresponding path program 1 times [2023-04-02 00:53:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:53:38,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031581907] [2023-04-02 00:53:38,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:53:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:53:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:38,736 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 00:53:38,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:53:38,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031581907] [2023-04-02 00:53:38,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031581907] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:53:38,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:53:38,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-02 00:53:38,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207477617] [2023-04-02 00:53:38,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:53:38,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 00:53:38,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:53:38,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 00:53:38,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-04-02 00:53:38,739 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 00:53:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:53:39,091 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2023-04-02 00:53:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 00:53:39,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 00:53:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:53:39,092 INFO L225 Difference]: With dead ends: 79 [2023-04-02 00:53:39,093 INFO L226 Difference]: Without dead ends: 64 [2023-04-02 00:53:39,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2023-04-02 00:53:39,094 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 154 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 00:53:39,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 31 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 00:53:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-02 00:53:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2023-04-02 00:53:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 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 00:53:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2023-04-02 00:53:39,101 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 20 [2023-04-02 00:53:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:53:39,101 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2023-04-02 00:53:39,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 00:53:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2023-04-02 00:53:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-02 00:53:39,102 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:53:39,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:53:39,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 00:53:39,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:53:39,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:53:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1459126447, now seen corresponding path program 1 times [2023-04-02 00:53:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:53:39,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588364618] [2023-04-02 00:53:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:53:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:39,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:53:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:39,277 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 00:53:39,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:53:39,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588364618] [2023-04-02 00:53:39,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588364618] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:53:39,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:53:39,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 00:53:39,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727184457] [2023-04-02 00:53:39,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:53:39,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 00:53:39,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:53:39,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 00:53:39,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-02 00:53:39,279 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 00:53:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:53:39,513 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2023-04-02 00:53:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 00:53:39,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 00:53:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:53:39,514 INFO L225 Difference]: With dead ends: 55 [2023-04-02 00:53:39,514 INFO L226 Difference]: Without dead ends: 53 [2023-04-02 00:53:39,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-04-02 00:53:39,515 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 51 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 00:53:39,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 22 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 00:53:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-04-02 00:53:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2023-04-02 00:53:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 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 00:53:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2023-04-02 00:53:39,522 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 20 [2023-04-02 00:53:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:53:39,522 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-04-02 00:53:39,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 00:53:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2023-04-02 00:53:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-02 00:53:39,523 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:53:39,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:53:39,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 00:53:39,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:53:39,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:53:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2143674818, now seen corresponding path program 1 times [2023-04-02 00:53:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:53:39,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450215994] [2023-04-02 00:53:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:53:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:53:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:39,691 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 00:53:39,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:53:39,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450215994] [2023-04-02 00:53:39,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450215994] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:53:39,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:53:39,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 00:53:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672540002] [2023-04-02 00:53:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:53:39,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 00:53:39,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:53:39,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 00:53:39,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 00:53:39,693 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 00:53:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:53:39,944 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2023-04-02 00:53:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 00:53:39,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 21 [2023-04-02 00:53:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:53:39,945 INFO L225 Difference]: With dead ends: 84 [2023-04-02 00:53:39,945 INFO L226 Difference]: Without dead ends: 82 [2023-04-02 00:53:39,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-04-02 00:53:39,946 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 71 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 00:53:39,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 22 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 00:53:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-04-02 00:53:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 52. [2023-04-02 00:53:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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 00:53:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-04-02 00:53:39,958 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 21 [2023-04-02 00:53:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:53:39,959 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-04-02 00:53:39,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 00:53:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-04-02 00:53:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 00:53:39,964 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:53:39,964 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:53:39,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-02 00:53:39,964 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:53:39,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:53:39,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1326770588, now seen corresponding path program 1 times [2023-04-02 00:53:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:53:39,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415975833] [2023-04-02 00:53:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:39,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:53:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:40,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:53:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:53:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:53:40,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415975833] [2023-04-02 00:53:40,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415975833] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:53:40,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083062920] [2023-04-02 00:53:40,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:40,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:53:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:53:40,563 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 00:53:40,565 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 00:53:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:40,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 44 conjunts are in the unsatisfiable core [2023-04-02 00:53:40,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:53:40,806 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 00:53:40,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 00:53:40,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:40,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 00:53:40,883 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 00:53:40,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 00:53:40,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:40,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-04-02 00:53:40,997 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 0 case distinctions, treesize of input 18 treesize of output 18 [2023-04-02 00:53:41,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 39 [2023-04-02 00:53:41,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:41,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:41,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:53:41,015 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 17 treesize of output 16 [2023-04-02 00:53:41,024 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 18 treesize of output 16 [2023-04-02 00:53:41,040 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 00:53:41,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 00:53:41,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:41,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:41,100 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 17 treesize of output 21 [2023-04-02 00:53:41,119 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-04-02 00:53:41,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-04-02 00:53:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:53:41,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:53:41,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:53:41,253 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 41 treesize of output 42 [2023-04-02 00:53:41,266 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 100 treesize of output 76 [2023-04-02 00:53:41,275 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 32 treesize of output 30 [2023-04-02 00:53:47,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:53:47,618 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 2 case distinctions, treesize of input 146 treesize of output 122 [2023-04-02 00:53:47,627 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 320 treesize of output 316 [2023-04-02 00:53:47,645 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 185 treesize of output 181 [2023-04-02 00:53:47,660 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 187 treesize of output 179 [2023-04-02 00:53:47,674 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 149 treesize of output 141 [2023-04-02 00:53:47,679 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 141 treesize of output 137 [2023-04-02 00:53:47,684 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 137 treesize of output 133 [2023-04-02 00:53:47,690 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 133 treesize of output 125 [2023-04-02 00:53:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:53:48,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083062920] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 00:53:48,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 00:53:48,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2023-04-02 00:53:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256334607] [2023-04-02 00:53:48,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 00:53:48,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-02 00:53:48,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:53:48,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-02 00:53:48,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=290, Unknown=3, NotChecked=0, Total=380 [2023-04-02 00:53:48,648 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 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 00:53:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:53:49,162 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2023-04-02 00:53:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 00:53:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 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 23 [2023-04-02 00:53:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:53:49,164 INFO L225 Difference]: With dead ends: 109 [2023-04-02 00:53:49,164 INFO L226 Difference]: Without dead ends: 92 [2023-04-02 00:53:49,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=179, Invalid=468, Unknown=3, NotChecked=0, Total=650 [2023-04-02 00:53:49,165 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 305 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-02 00:53:49,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 40 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-02 00:53:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-04-02 00:53:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 60. [2023-04-02 00:53:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 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 00:53:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2023-04-02 00:53:49,175 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 23 [2023-04-02 00:53:49,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:53:49,175 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2023-04-02 00:53:49,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 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 00:53:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2023-04-02 00:53:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 00:53:49,176 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:53:49,176 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:53:49,188 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 00:53:49,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:53:49,383 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:53:49,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:53:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1191342304, now seen corresponding path program 1 times [2023-04-02 00:53:49,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:53:49,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168677011] [2023-04-02 00:53:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:53:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:51,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:53:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:53:51,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:53:51,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168677011] [2023-04-02 00:53:51,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168677011] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:53:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796548890] [2023-04-02 00:53:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:53:51,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:53:51,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:53:51,165 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 00:53:51,168 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 00:53:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:53:51,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 98 conjunts are in the unsatisfiable core [2023-04-02 00:53:51,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:53:51,366 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 00:53:51,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,395 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 0 case distinctions, treesize of input 19 treesize of output 23 [2023-04-02 00:53:51,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,402 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 0 case distinctions, treesize of input 19 treesize of output 23 [2023-04-02 00:53:51,409 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 00:53:51,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2023-04-02 00:53:51,438 INFO L321 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2023-04-02 00:53:51,438 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 28 treesize of output 44 [2023-04-02 00:53:51,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2023-04-02 00:53:51,451 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 12 treesize of output 11 [2023-04-02 00:53:51,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2023-04-02 00:53:51,488 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2023-04-02 00:53:51,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2023-04-02 00:53:51,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,630 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-04-02 00:53:51,630 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 63 [2023-04-02 00:53:51,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-04-02 00:53:51,682 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2023-04-02 00:53:51,682 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 4 case distinctions, treesize of input 115 treesize of output 103 [2023-04-02 00:53:51,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,700 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:53:51,701 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 39 treesize of output 39 [2023-04-02 00:53:51,713 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 30 treesize of output 28 [2023-04-02 00:53:51,744 INFO L321 Elim1Store]: treesize reduction 64, result has 35.4 percent of original size [2023-04-02 00:53:51,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 53 [2023-04-02 00:53:51,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,867 INFO L321 Elim1Store]: treesize reduction 76, result has 21.6 percent of original size [2023-04-02 00:53:51,868 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 95 [2023-04-02 00:53:51,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:53:51,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-04-02 00:53:51,898 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 14 treesize of output 13 [2023-04-02 00:53:51,935 INFO L321 Elim1Store]: treesize reduction 12, result has 81.0 percent of original size [2023-04-02 00:53:51,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 63 [2023-04-02 00:53:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:53:52,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:53:52,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:53:52,588 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 127 treesize of output 115 [2023-04-02 00:53:52,991 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_main_~x~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~x~0.base) c_main_~x~0.offset 0))) (.cse5 (+ c_main_~head~0.offset 8)) (.cse7 (select |c_#memory_$Pointer$.base| c_main_~x~0.base))) (and (forall ((v_ArrVal_696 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_subst_3 Int)) (let ((.cse0 (select v_arrayElimArr_11 (+ 8 v_subst_3)))) (or (not (= (select (store |c_#valid| v_ArrVal_696 1) .cse0) 0)) (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store .cse7 c_main_~x~0.offset v_ArrVal_696)))) (let ((.cse4 (select (select (store .cse3 v_ArrVal_696 v_ArrVal_705) c_main_~x~0.base) c_main_~x~0.offset))) (let ((.cse2 (store (store (store .cse6 v_ArrVal_696 v_ArrVal_704) .cse4 v_ArrVal_716) .cse0 v_ArrVal_710))) (let ((.cse1 (select (select .cse2 c_main_~head~0.base) .cse5))) (or (= c_main_~head~0.offset .cse1) (= (select (select .cse2 (select (select (store (store (store .cse3 v_ArrVal_696 v_ArrVal_694) .cse4 v_arrayElimArr_11) .cse0 v_ArrVal_714) c_main_~head~0.base) .cse5)) .cse1) 0)))))))))) (not (= (select |c_#valid| v_ArrVal_696) 0)))) (forall ((v_ArrVal_696 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_subst_4 Int)) (let ((.cse11 (select v_arrayElimArr_11 (+ 8 v_subst_4)))) (or (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store .cse7 c_main_~x~0.offset v_ArrVal_696)))) (let ((.cse10 (select (select (store .cse12 v_ArrVal_696 v_ArrVal_705) c_main_~x~0.base) c_main_~x~0.offset))) (let ((.cse9 (select (select (store (store (store .cse12 v_ArrVal_696 v_ArrVal_694) .cse10 v_arrayElimArr_11) .cse11 v_ArrVal_714) c_main_~head~0.base) .cse5))) (or (= (let ((.cse8 (store (store (store .cse6 v_ArrVal_696 v_ArrVal_704) .cse10 v_ArrVal_716) .cse11 v_ArrVal_710))) (select (select .cse8 .cse9) (select (select .cse8 c_main_~head~0.base) .cse5))) 0) (= .cse9 c_main_~head~0.base)))))) (not (= (select (store |c_#valid| v_ArrVal_696 1) .cse11) 0))))) (not (= (select |c_#valid| v_ArrVal_696) 0)))) (forall ((v_ArrVal_696 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_subst_2 Int)) (let ((.cse13 (select v_arrayElimArr_11 (+ 8 v_subst_2)))) (or (not (= (select (store |c_#valid| v_ArrVal_696 1) .cse13) 0)) (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store .cse7 c_main_~x~0.offset v_ArrVal_696)))) (let ((.cse17 (select (select (store .cse16 v_ArrVal_696 v_ArrVal_705) c_main_~x~0.base) c_main_~x~0.offset))) (let ((.cse14 (select (select (store (store (store .cse6 v_ArrVal_696 v_ArrVal_704) .cse17 v_ArrVal_716) .cse13 v_ArrVal_710) c_main_~head~0.base) .cse5))) (or (= c_main_~head~0.offset .cse14) (= (select (let ((.cse15 (store (store (store .cse16 v_ArrVal_696 v_ArrVal_694) .cse17 v_arrayElimArr_11) .cse13 v_ArrVal_714))) (select .cse15 (select (select .cse15 c_main_~head~0.base) .cse5))) .cse14) 0))))))))) (not (= (select |c_#valid| v_ArrVal_696) 0)))) (forall ((v_ArrVal_696 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_subst_1 Int)) (let ((.cse21 (select v_arrayElimArr_11 (+ 8 v_subst_1)))) (or (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store .cse7 c_main_~x~0.offset v_ArrVal_696)))) (let ((.cse20 (select (select (store .cse22 v_ArrVal_696 v_ArrVal_705) c_main_~x~0.base) c_main_~x~0.offset))) (let ((.cse19 (store (store (store .cse22 v_ArrVal_696 v_ArrVal_694) .cse20 v_arrayElimArr_11) .cse21 v_ArrVal_714))) (let ((.cse18 (select (select .cse19 c_main_~head~0.base) .cse5))) (or (= c_main_~head~0.base .cse18) (= (select (select .cse19 .cse18) (select (select (store (store (store .cse6 v_ArrVal_696 v_ArrVal_704) .cse20 v_ArrVal_716) .cse21 v_ArrVal_710) c_main_~head~0.base) .cse5)) 0))))))) (not (= (select (store |c_#valid| v_ArrVal_696 1) .cse21) 0))))) (not (= (select |c_#valid| v_ArrVal_696) 0)))))) is different from false [2023-04-02 00:53:53,234 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| c_main_~head~0.base)) (.cse2 (+ c_main_~head~0.offset 8)) (.cse7 (select |c_#memory_$Pointer$.base| c_main_~head~0.base))) (and (forall ((v_main_~x~0.offset_26 Int)) (or (forall ((v_ArrVal_696 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_subst_4 Int)) (let ((.cse5 (select v_arrayElimArr_11 (+ 8 v_subst_4)))) (or (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| c_main_~head~0.base (store .cse7 v_main_~x~0.offset_26 v_ArrVal_696)))) (let ((.cse4 (select (select (store .cse6 v_ArrVal_696 v_ArrVal_705) c_main_~head~0.base) v_main_~x~0.offset_26))) (let ((.cse0 (select (select (store (store (store .cse6 v_ArrVal_696 v_ArrVal_694) .cse4 v_arrayElimArr_11) .cse5 v_ArrVal_714) c_main_~head~0.base) .cse2))) (or (= .cse0 c_main_~head~0.base) (= (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.offset| c_main_~head~0.base (store .cse3 v_main_~x~0.offset_26 0)) v_ArrVal_696 v_ArrVal_704) .cse4 v_ArrVal_716) .cse5 v_ArrVal_710))) (select (select .cse1 .cse0) (select (select .cse1 c_main_~head~0.base) .cse2))) 0)))))) (not (= (select (store |c_#valid| v_ArrVal_696 1) .cse5) 0))))) (not (= (select |c_#valid| v_ArrVal_696) 0)))) (< c_main_~head~0.offset v_main_~x~0.offset_26))) (forall ((v_main_~x~0.offset_26 Int)) (or (< c_main_~head~0.offset v_main_~x~0.offset_26) (forall ((v_ArrVal_696 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_subst_2 Int)) (let ((.cse12 (select v_arrayElimArr_11 (+ 8 v_subst_2)))) (or (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| c_main_~head~0.base (store .cse7 v_main_~x~0.offset_26 v_ArrVal_696)))) (let ((.cse11 (select (select (store .cse10 v_ArrVal_696 v_ArrVal_705) c_main_~head~0.base) v_main_~x~0.offset_26))) (let ((.cse8 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| c_main_~head~0.base (store .cse3 v_main_~x~0.offset_26 0)) v_ArrVal_696 v_ArrVal_704) .cse11 v_ArrVal_716) .cse12 v_ArrVal_710) c_main_~head~0.base) .cse2))) (or (= c_main_~head~0.offset .cse8) (= (select (let ((.cse9 (store (store (store .cse10 v_ArrVal_696 v_ArrVal_694) .cse11 v_arrayElimArr_11) .cse12 v_ArrVal_714))) (select .cse9 (select (select .cse9 c_main_~head~0.base) .cse2))) .cse8) 0)))))) (not (= (select (store |c_#valid| v_ArrVal_696 1) .cse12) 0))))) (not (= (select |c_#valid| v_ArrVal_696) 0)))))) (forall ((v_main_~x~0.offset_26 Int)) (or (forall ((v_ArrVal_696 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_subst_3 Int)) (let ((.cse16 (select v_arrayElimArr_11 (+ 8 v_subst_3)))) (or (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| c_main_~head~0.base (store .cse7 v_main_~x~0.offset_26 v_ArrVal_696)))) (let ((.cse15 (select (select (store .cse14 v_ArrVal_696 v_ArrVal_705) c_main_~head~0.base) v_main_~x~0.offset_26))) (let ((.cse13 (store (store (store (store |c_#memory_$Pointer$.offset| c_main_~head~0.base (store .cse3 v_main_~x~0.offset_26 0)) v_ArrVal_696 v_ArrVal_704) .cse15 v_ArrVal_716) .cse16 v_ArrVal_710))) (let ((.cse17 (select (select .cse13 c_main_~head~0.base) .cse2))) (or (= (select (select .cse13 (select (select (store (store (store .cse14 v_ArrVal_696 v_ArrVal_694) .cse15 v_arrayElimArr_11) .cse16 v_ArrVal_714) c_main_~head~0.base) .cse2)) .cse17) 0) (= c_main_~head~0.offset .cse17))))))) (not (= (select (store |c_#valid| v_ArrVal_696 1) .cse16) 0))))) (not (= (select |c_#valid| v_ArrVal_696) 0)))) (< c_main_~head~0.offset v_main_~x~0.offset_26))) (forall ((v_main_~x~0.offset_26 Int)) (or (forall ((v_ArrVal_696 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_subst_1 Int)) (let ((.cse21 (select v_arrayElimArr_11 (+ 8 v_subst_1)))) (or (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| c_main_~head~0.base (store .cse7 v_main_~x~0.offset_26 v_ArrVal_696)))) (let ((.cse20 (select (select (store .cse22 v_ArrVal_696 v_ArrVal_705) c_main_~head~0.base) v_main_~x~0.offset_26))) (let ((.cse18 (store (store (store .cse22 v_ArrVal_696 v_ArrVal_694) .cse20 v_arrayElimArr_11) .cse21 v_ArrVal_714))) (let ((.cse19 (select (select .cse18 c_main_~head~0.base) .cse2))) (or (= (select (select .cse18 .cse19) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| c_main_~head~0.base (store .cse3 v_main_~x~0.offset_26 0)) v_ArrVal_696 v_ArrVal_704) .cse20 v_ArrVal_716) .cse21 v_ArrVal_710) c_main_~head~0.base) .cse2)) 0) (= c_main_~head~0.base .cse19))))))) (not (= (select (store |c_#valid| v_ArrVal_696 1) .cse21) 0))))) (not (= (select |c_#valid| v_ArrVal_696) 0)))) (< c_main_~head~0.offset v_main_~x~0.offset_26))))) is different from false [2023-04-02 00:53:56,609 INFO L321 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2023-04-02 00:53:56,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3849 treesize of output 3528 [2023-04-02 00:54:02,603 WARN L223 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 25 DAG size of output: 22 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-04-02 00:54:02,604 INFO L321 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2023-04-02 00:54:02,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 6257 treesize of output 4352 [2023-04-02 00:54:08,974 WARN L223 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 140 DAG size of output: 116 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-04-02 00:54:08,975 INFO L321 Elim1Store]: treesize reduction 576, result has 60.0 percent of original size [2023-04-02 00:54:08,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58649684 treesize of output 57841396 [2023-04-02 00:54:18,200 WARN L223 SmtUtils]: Spent 9.18s on a formula simplification. DAG size of input: 9860 DAG size of output: 1407 (called from [L 809] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-04-02 00:54:46,948 WARN L223 SmtUtils]: Spent 24.87s on a formula simplification. DAG size of input: 415 DAG size of output: 315 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-04-02 00:54:46,949 INFO L321 Elim1Store]: treesize reduction 368, result has 76.4 percent of original size [2023-04-02 00:54:47,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 16 new quantified variables, introduced 91 case distinctions, treesize of input 1203348456 treesize of output 1196788778