/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/list-ext2-properties/list_and_tree_cnstr-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 00:58:59,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 00:58:59,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 00:58:59,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 00:58:59,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 00:58:59,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 00:58:59,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 00:58:59,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 00:58:59,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 00:58:59,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 00:58:59,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 00:58:59,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 00:58:59,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 00:58:59,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 00:58:59,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 00:58:59,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 00:58:59,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 00:58:59,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 00:58:59,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 00:58:59,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 00:58:59,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 00:58:59,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 00:58:59,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 00:58:59,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 00:58:59,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 00:58:59,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 00:58:59,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 00:58:59,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 00:58:59,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 00:58:59,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 00:58:59,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 00:58:59,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 00:58:59,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 00:58:59,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 00:58:59,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 00:58:59,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 00:58:59,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 00:58:59,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 00:58:59,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 00:58:59,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 00:58:59,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 00:58:59,834 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:58:59,847 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 00:58:59,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 00:58:59,848 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 00:58:59,848 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 00:58:59,848 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 00:58:59,848 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 00:58:59,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 00:58:59,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 00:58:59,849 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 00:58:59,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 00:58:59,849 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 00:58:59,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 00:58:59,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 00:58:59,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 00:58:59,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 00:58:59,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 00:58:59,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 00:58:59,850 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 00:58:59,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 00:58:59,850 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 00:58:59,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 00:58:59,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 00:58:59,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 00:58:59,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 00:58:59,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 00:58:59,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 00:58:59,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 00:58:59,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 00:58:59,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 00:58:59,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 00:58:59,851 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 00:58:59,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 00:58:59,852 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 00:58:59,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 00:58:59,852 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 00:58:59,852 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:59:00,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 00:59:00,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 00:59:00,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 00:59:00,029 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 00:59:00,030 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 00:59:00,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2023-04-02 00:59:01,019 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 00:59:01,222 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 00:59:01,222 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2023-04-02 00:59:01,230 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84f2b779/0f49fdc18c8f4dedbfcc0efcc5e46880/FLAG3d82be71c [2023-04-02 00:59:01,246 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84f2b779/0f49fdc18c8f4dedbfcc0efcc5e46880 [2023-04-02 00:59:01,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 00:59:01,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 00:59:01,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 00:59:01,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 00:59:01,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 00:59:01,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ed9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01, skipping insertion in model container [2023-04-02 00:59:01,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 00:59:01,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 00:59:01,499 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2023-04-02 00:59:01,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 00:59:01,520 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 00:59:01,551 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2023-04-02 00:59:01,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 00:59:01,569 INFO L208 MainTranslator]: Completed translation [2023-04-02 00:59:01,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01 WrapperNode [2023-04-02 00:59:01,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 00:59:01,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 00:59:01,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 00:59:01,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 00:59:01,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,612 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 00:59:01,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 00:59:01,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 00:59:01,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 00:59:01,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01" (1/1) ... [2023-04-02 00:59:01,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 00:59:01,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:59:01,652 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:59:01,658 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:59:01,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 00:59:01,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 00:59:01,679 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 00:59:01,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 00:59:01,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 00:59:01,679 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-02 00:59:01,679 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 00:59:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 00:59:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 00:59:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 00:59:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 00:59:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 00:59:01,685 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 00:59:01,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 00:59:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 00:59:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 00:59:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 00:59:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 00:59:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 00:59:01,861 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 00:59:01,863 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 00:59:01,945 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-02 00:59:02,142 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 00:59:02,146 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 00:59:02,147 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-04-02 00:59:02,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 12:59:02 BoogieIcfgContainer [2023-04-02 00:59:02,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 00:59:02,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 00:59:02,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 00:59:02,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 00:59:02,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 12:59:01" (1/3) ... [2023-04-02 00:59:02,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338f2b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 12:59:02, skipping insertion in model container [2023-04-02 00:59:02,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 12:59:01" (2/3) ... [2023-04-02 00:59:02,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338f2b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 12:59:02, skipping insertion in model container [2023-04-02 00:59:02,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 12:59:02" (3/3) ... [2023-04-02 00:59:02,154 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2023-04-02 00:59:02,168 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 00:59:02,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 00:59:02,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 00:59:02,227 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;@7321723c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 00:59:02,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 00:59:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 51 states have internal predecessors, (79), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 00:59:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-02 00:59:02,239 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:02,239 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:59:02,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:02,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:02,243 INFO L85 PathProgramCache]: Analyzing trace with hash -684445710, now seen corresponding path program 1 times [2023-04-02 00:59:02,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:02,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772294882] [2023-04-02 00:59:02,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:02,382 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:59:02,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772294882] [2023-04-02 00:59:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772294882] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:59:02,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:59:02,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 00:59:02,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312475611] [2023-04-02 00:59:02,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:59:02,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 00:59:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:02,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 00:59:02,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 00:59:02,421 INFO L87 Difference]: Start difference. First operand has 57 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 51 states have internal predecessors, (79), 5 states have call successors, (5), 3 states have call predecessors, (5), 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.666666666666667) internal successors, (17), 2 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:59:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:02,579 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2023-04-02 00:59:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 00:59:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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:59:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:02,588 INFO L225 Difference]: With dead ends: 108 [2023-04-02 00:59:02,588 INFO L226 Difference]: Without dead ends: 47 [2023-04-02 00:59:02,590 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:59:02,595 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 70 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:02,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 10 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 00:59:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-04-02 00:59:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-04-02 00:59:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 43 states have internal predecessors, (61), 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:59:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2023-04-02 00:59:02,631 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2023-04-02 00:59:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:02,633 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2023-04-02 00:59:02,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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:59:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2023-04-02 00:59:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-02 00:59:02,634 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:02,634 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, 1, 1, 1, 1] [2023-04-02 00:59:02,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 00:59:02,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:02,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash 632966512, now seen corresponding path program 1 times [2023-04-02 00:59:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:02,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860036048] [2023-04-02 00:59:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:02,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:02,728 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:59:02,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860036048] [2023-04-02 00:59:02,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860036048] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:59:02,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:59:02,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 00:59:02,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611244253] [2023-04-02 00:59:02,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:59:02,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 00:59:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 00:59:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 00:59:02,730 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:59:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:02,874 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2023-04-02 00:59:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 00:59:02,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2023-04-02 00:59:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:02,877 INFO L225 Difference]: With dead ends: 75 [2023-04-02 00:59:02,877 INFO L226 Difference]: Without dead ends: 55 [2023-04-02 00:59:02,881 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:59:02,885 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:02,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 12 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 00:59:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-04-02 00:59:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-04-02 00:59:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 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:59:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2023-04-02 00:59:02,903 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2023-04-02 00:59:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:02,903 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2023-04-02 00:59:02,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:59:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2023-04-02 00:59:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-02 00:59:02,904 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:02,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:02,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 00:59:02,904 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:02,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:02,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1492772291, now seen corresponding path program 1 times [2023-04-02 00:59:02,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:02,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558268223] [2023-04-02 00:59:02,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:02,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:59:03,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:03,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558268223] [2023-04-02 00:59:03,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558268223] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:59:03,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:59:03,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 00:59:03,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445551660] [2023-04-02 00:59:03,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:59:03,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 00:59:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:03,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 00:59:03,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 00:59:03,256 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:59:03,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:03,603 INFO L93 Difference]: Finished difference Result 146 states and 212 transitions. [2023-04-02 00:59:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 00:59:03,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2023-04-02 00:59:03,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:03,604 INFO L225 Difference]: With dead ends: 146 [2023-04-02 00:59:03,604 INFO L226 Difference]: Without dead ends: 110 [2023-04-02 00:59:03,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-04-02 00:59:03,605 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 201 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:03,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 22 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 00:59:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-04-02 00:59:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2023-04-02 00:59:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 74 states have internal predecessors, (110), 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:59:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2023-04-02 00:59:03,614 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 31 [2023-04-02 00:59:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:03,614 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2023-04-02 00:59:03,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:59:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2023-04-02 00:59:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-02 00:59:03,615 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:03,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:03,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 00:59:03,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:03,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1984546555, now seen corresponding path program 1 times [2023-04-02 00:59:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:03,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825764808] [2023-04-02 00:59:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:03,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:03,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:03,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825764808] [2023-04-02 00:59:03,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825764808] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:59:03,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:59:03,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 00:59:03,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372512910] [2023-04-02 00:59:03,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:59:03,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 00:59:03,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:03,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 00:59:03,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 00:59:03,774 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:59:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:03,966 INFO L93 Difference]: Finished difference Result 103 states and 142 transitions. [2023-04-02 00:59:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 00:59:03,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2023-04-02 00:59:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:03,969 INFO L225 Difference]: With dead ends: 103 [2023-04-02 00:59:03,970 INFO L226 Difference]: Without dead ends: 99 [2023-04-02 00:59:03,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-04-02 00:59:03,977 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 94 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:03,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 21 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 00:59:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-04-02 00:59:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2023-04-02 00:59:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 83 states have internal predecessors, (122), 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:59:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2023-04-02 00:59:03,986 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 31 [2023-04-02 00:59:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:03,986 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2023-04-02 00:59:03,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:59:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2023-04-02 00:59:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-02 00:59:03,987 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:03,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:03,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 00:59:03,987 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:03,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1257143350, now seen corresponding path program 1 times [2023-04-02 00:59:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693669099] [2023-04-02 00:59:03,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:04,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:04,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693669099] [2023-04-02 00:59:04,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693669099] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:59:04,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:59:04,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 00:59:04,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003580351] [2023-04-02 00:59:04,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:59:04,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 00:59:04,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:04,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 00:59:04,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 00:59:04,133 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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:59:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:04,298 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2023-04-02 00:59:04,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 00:59:04,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 33 [2023-04-02 00:59:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:04,300 INFO L225 Difference]: With dead ends: 107 [2023-04-02 00:59:04,300 INFO L226 Difference]: Without dead ends: 99 [2023-04-02 00:59:04,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-04-02 00:59:04,301 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 94 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:04,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 21 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 00:59:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-04-02 00:59:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2023-04-02 00:59:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 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:59:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2023-04-02 00:59:04,326 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 33 [2023-04-02 00:59:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:04,326 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2023-04-02 00:59:04,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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:59:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2023-04-02 00:59:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-02 00:59:04,327 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:04,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:04,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 00:59:04,327 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:04,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash 232440374, now seen corresponding path program 1 times [2023-04-02 00:59:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:04,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640609679] [2023-04-02 00:59:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:04,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:04,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:04,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640609679] [2023-04-02 00:59:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640609679] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 00:59:04,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 00:59:04,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 00:59:04,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492935676] [2023-04-02 00:59:04,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 00:59:04,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 00:59:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 00:59:04,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 00:59:04,407 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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:59:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:04,579 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2023-04-02 00:59:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 00:59:04,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 33 [2023-04-02 00:59:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:04,581 INFO L225 Difference]: With dead ends: 105 [2023-04-02 00:59:04,581 INFO L226 Difference]: Without dead ends: 94 [2023-04-02 00:59:04,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-04-02 00:59:04,582 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 99 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:04,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 21 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 00:59:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-04-02 00:59:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2023-04-02 00:59:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 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:59:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2023-04-02 00:59:04,588 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 33 [2023-04-02 00:59:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:04,588 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2023-04-02 00:59:04,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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:59:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2023-04-02 00:59:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-04-02 00:59:04,589 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:04,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:04,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 00:59:04,590 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:04,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:04,590 INFO L85 PathProgramCache]: Analyzing trace with hash 678282914, now seen corresponding path program 1 times [2023-04-02 00:59:04,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:04,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377735875] [2023-04-02 00:59:04,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:04,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:04,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:04,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377735875] [2023-04-02 00:59:04,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377735875] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:59:04,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835361172] [2023-04-02 00:59:04,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:04,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:04,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:59:04,812 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:59:04,817 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:59:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:04,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-02 00:59:04,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:59:04,991 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:59:05,083 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 00:59:05,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-02 00:59:05,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 00:59:05,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-04-02 00:59:05,189 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:59:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:05,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:59:05,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:05,296 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 23 treesize of output 29 [2023-04-02 00:59:05,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:05,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-04-02 00:59:05,315 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 9 treesize of output 7 [2023-04-02 00:59:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:05,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835361172] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 00:59:05,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 00:59:05,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-04-02 00:59:05,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965674115] [2023-04-02 00:59:05,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 00:59:05,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 00:59:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 00:59:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=244, Unknown=7, NotChecked=0, Total=306 [2023-04-02 00:59:05,436 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 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:59:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:05,952 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2023-04-02 00:59:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 00:59:05,952 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-04-02 00:59:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:05,953 INFO L225 Difference]: With dead ends: 107 [2023-04-02 00:59:05,953 INFO L226 Difference]: Without dead ends: 103 [2023-04-02 00:59:05,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=453, Unknown=7, NotChecked=0, Total=600 [2023-04-02 00:59:05,954 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 177 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:05,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 48 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-02 00:59:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-04-02 00:59:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2023-04-02 00:59:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 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:59:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2023-04-02 00:59:05,972 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 35 [2023-04-02 00:59:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:05,972 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2023-04-02 00:59:05,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 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:59:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2023-04-02 00:59:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-04-02 00:59:05,973 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:05,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:05,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-02 00:59:06,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:06,186 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:06,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1541684578, now seen corresponding path program 1 times [2023-04-02 00:59:06,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:06,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928574026] [2023-04-02 00:59:06,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:06,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:06,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:06,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928574026] [2023-04-02 00:59:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928574026] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:59:06,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701208437] [2023-04-02 00:59:06,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:06,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:06,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:59:06,401 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:59:06,405 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:59:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:06,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-02 00:59:06,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:59:06,526 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:59:06,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 00:59:06,575 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 00:59:06,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-02 00:59:06,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-04-02 00:59:06,656 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:59:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:06,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:59:06,680 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~p~0.base v_ArrVal_280) c_main_~a~0.base) c_main_~a~0.offset) 1)) is different from false [2023-04-02 00:59:06,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:06,728 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 23 treesize of output 29 [2023-04-02 00:59:06,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:06,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-04-02 00:59:06,747 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 9 treesize of output 7 [2023-04-02 00:59:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-04-02 00:59:06,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701208437] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 00:59:06,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 00:59:06,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-04-02 00:59:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546933555] [2023-04-02 00:59:06,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 00:59:06,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 00:59:06,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:06,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 00:59:06,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2023-04-02 00:59:06,802 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 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:59:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:07,339 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2023-04-02 00:59:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 00:59:07,339 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-04-02 00:59:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:07,340 INFO L225 Difference]: With dead ends: 106 [2023-04-02 00:59:07,340 INFO L226 Difference]: Without dead ends: 100 [2023-04-02 00:59:07,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=416, Unknown=3, NotChecked=44, Total=600 [2023-04-02 00:59:07,340 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 120 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:07,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 44 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 552 Invalid, 0 Unknown, 80 Unchecked, 0.4s Time] [2023-04-02 00:59:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-04-02 00:59:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2023-04-02 00:59:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 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:59:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2023-04-02 00:59:07,347 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 35 [2023-04-02 00:59:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:07,347 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2023-04-02 00:59:07,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 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:59:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2023-04-02 00:59:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-02 00:59:07,348 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:07,348 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:07,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 00:59:07,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-04-02 00:59:07,554 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:07,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:07,554 INFO L85 PathProgramCache]: Analyzing trace with hash 68234781, now seen corresponding path program 1 times [2023-04-02 00:59:07,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:07,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617040354] [2023-04-02 00:59:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:07,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:07,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:07,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:07,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617040354] [2023-04-02 00:59:07,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617040354] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:59:07,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126096949] [2023-04-02 00:59:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:07,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:07,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:59:07,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 00:59:07,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 00:59:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:07,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 36 conjunts are in the unsatisfiable core [2023-04-02 00:59:07,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:59:07,851 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:59:07,874 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 00:59:07,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-02 00:59:07,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 00:59:07,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 00:59:07,935 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 00:59:07,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2023-04-02 00:59:07,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-04-02 00:59:07,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-04-02 00:59:07,963 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 39 treesize of output 21 [2023-04-02 00:59:07,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-04-02 00:59:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:07,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:59:08,018 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 79 treesize of output 57 [2023-04-02 00:59:08,024 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~a~0.offset 4))) (and (forall ((v_ArrVal_357 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_ArrVal_357) c_main_~a~0.base) .cse0) c_main_~p~0.offset)) (forall ((v_ArrVal_358 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_358) c_main_~a~0.base) .cse0) c_main_~p~0.base)))) is different from false [2023-04-02 00:59:08,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:08,037 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 22 treesize of output 23 [2023-04-02 00:59:08,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:08,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-04-02 00:59:08,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-02 00:59:08,055 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-02 00:59:08,055 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 22 treesize of output 1 [2023-04-02 00:59:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-04-02 00:59:08,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126096949] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 00:59:08,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 00:59:08,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-04-02 00:59:08,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513175769] [2023-04-02 00:59:08,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 00:59:08,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 00:59:08,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:08,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 00:59:08,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2023-04-02 00:59:08,142 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 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:59:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:08,912 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2023-04-02 00:59:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-02 00:59:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 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 37 [2023-04-02 00:59:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:08,915 INFO L225 Difference]: With dead ends: 133 [2023-04-02 00:59:08,915 INFO L226 Difference]: Without dead ends: 121 [2023-04-02 00:59:08,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=796, Unknown=1, NotChecked=60, Total=1056 [2023-04-02 00:59:08,917 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 175 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 22 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:08,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 67 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 916 Invalid, 17 Unknown, 103 Unchecked, 0.5s Time] [2023-04-02 00:59:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-04-02 00:59:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2023-04-02 00:59:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 107 states have internal predecessors, (149), 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:59:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 152 transitions. [2023-04-02 00:59:08,931 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 152 transitions. Word has length 37 [2023-04-02 00:59:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:08,931 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 152 transitions. [2023-04-02 00:59:08,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 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:59:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 152 transitions. [2023-04-02 00:59:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-02 00:59:08,932 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:08,932 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:08,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-02 00:59:09,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:09,137 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:09,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:09,137 INFO L85 PathProgramCache]: Analyzing trace with hash 5746392, now seen corresponding path program 1 times [2023-04-02 00:59:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:09,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560099115] [2023-04-02 00:59:09,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:09,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:09,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:59:09,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560099115] [2023-04-02 00:59:09,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560099115] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:59:09,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958940216] [2023-04-02 00:59:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:09,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:09,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:59:09,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 00:59:09,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 00:59:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:09,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 37 conjunts are in the unsatisfiable core [2023-04-02 00:59:09,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:59:09,642 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:59:09,683 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 00:59:09,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-02 00:59:09,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 00:59:09,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 00:59:09,745 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 00:59:09,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2023-04-02 00:59:09,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-04-02 00:59:09,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-04-02 00:59:09,777 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 39 treesize of output 21 [2023-04-02 00:59:09,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-04-02 00:59:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:09,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:59:09,823 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 52 treesize of output 30 [2023-04-02 00:59:09,827 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~a~0.offset 4))) (and (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_ArrVal_437) c_main_~a~0.base) .cse0) c_main_~p~0.offset)) (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_435) c_main_~a~0.base) .cse0) c_main_~p~0.base)))) is different from false [2023-04-02 00:59:09,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:09,839 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 22 treesize of output 23 [2023-04-02 00:59:09,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:09,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-04-02 00:59:09,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-02 00:59:09,859 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-02 00:59:09,860 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 22 treesize of output 1 [2023-04-02 00:59:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-04-02 00:59:09,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958940216] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 00:59:09,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 00:59:09,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2023-04-02 00:59:09,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134817677] [2023-04-02 00:59:09,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 00:59:09,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-04-02 00:59:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:09,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-04-02 00:59:09,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=364, Unknown=1, NotChecked=38, Total=462 [2023-04-02 00:59:09,927 INFO L87 Difference]: Start difference. First operand 111 states and 152 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 21 states have internal predecessors, (75), 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:59:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:10,575 INFO L93 Difference]: Finished difference Result 127 states and 169 transitions. [2023-04-02 00:59:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 00:59:10,575 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 21 states have internal predecessors, (75), 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 39 [2023-04-02 00:59:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:10,576 INFO L225 Difference]: With dead ends: 127 [2023-04-02 00:59:10,576 INFO L226 Difference]: Without dead ends: 114 [2023-04-02 00:59:10,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=793, Unknown=1, NotChecked=60, Total=1056 [2023-04-02 00:59:10,577 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 289 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:10,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 72 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 894 Invalid, 0 Unknown, 91 Unchecked, 0.4s Time] [2023-04-02 00:59:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-04-02 00:59:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2023-04-02 00:59:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 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:59:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2023-04-02 00:59:10,584 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 39 [2023-04-02 00:59:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:10,584 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2023-04-02 00:59:10,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 21 states have internal predecessors, (75), 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:59:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2023-04-02 00:59:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-02 00:59:10,585 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:10,585 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:10,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-02 00:59:10,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:10,793 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:10,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1772766824, now seen corresponding path program 1 times [2023-04-02 00:59:10,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:10,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843915230] [2023-04-02 00:59:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:59:11,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843915230] [2023-04-02 00:59:11,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843915230] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:59:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446151579] [2023-04-02 00:59:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:11,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:11,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:59:11,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 00:59:11,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 00:59:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:11,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 37 conjunts are in the unsatisfiable core [2023-04-02 00:59:11,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:59:11,266 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:59:11,301 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 00:59:11,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-02 00:59:11,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 00:59:11,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 00:59:11,360 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 00:59:11,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2023-04-02 00:59:11,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-04-02 00:59:11,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-04-02 00:59:11,389 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 39 treesize of output 21 [2023-04-02 00:59:11,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-04-02 00:59:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:11,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:59:11,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2023-04-02 00:59:11,448 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~a~0.offset 4))) (and (forall ((v_ArrVal_516 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_ArrVal_516) c_main_~a~0.base) .cse0) c_main_~p~0.offset)) (forall ((v_ArrVal_514 (Array Int Int))) (= c_main_~p~0.base (select (select (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_514) c_main_~a~0.base) .cse0))))) is different from false [2023-04-02 00:59:11,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:11,465 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 22 treesize of output 23 [2023-04-02 00:59:11,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:11,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-04-02 00:59:11,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-02 00:59:11,482 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-02 00:59:11,482 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 22 treesize of output 1 [2023-04-02 00:59:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-04-02 00:59:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446151579] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 00:59:11,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 00:59:11,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2023-04-02 00:59:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700498394] [2023-04-02 00:59:11,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 00:59:11,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-04-02 00:59:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:11,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-04-02 00:59:11,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=364, Unknown=1, NotChecked=38, Total=462 [2023-04-02 00:59:11,536 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 21 states have internal predecessors, (71), 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:59:20,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-04-02 00:59:22,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-04-02 00:59:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:22,471 INFO L93 Difference]: Finished difference Result 120 states and 161 transitions. [2023-04-02 00:59:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-02 00:59:22,471 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 21 states have internal predecessors, (71), 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 39 [2023-04-02 00:59:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:22,472 INFO L225 Difference]: With dead ends: 120 [2023-04-02 00:59:22,472 INFO L226 Difference]: Without dead ends: 107 [2023-04-02 00:59:22,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=217, Invalid=841, Unknown=2, NotChecked=62, Total=1122 [2023-04-02 00:59:22,473 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 235 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 30 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:22,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 65 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 740 Invalid, 15 Unknown, 83 Unchecked, 4.6s Time] [2023-04-02 00:59:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-04-02 00:59:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2023-04-02 00:59:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 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:59:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2023-04-02 00:59:22,479 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 39 [2023-04-02 00:59:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:22,480 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2023-04-02 00:59:22,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 21 states have internal predecessors, (71), 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:59:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2023-04-02 00:59:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-02 00:59:22,480 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:22,480 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:22,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 00:59:22,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-02 00:59:22,688 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:22,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 657101956, now seen corresponding path program 2 times [2023-04-02 00:59:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775369943] [2023-04-02 00:59:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:23,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:23,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:23,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775369943] [2023-04-02 00:59:23,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775369943] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:59:23,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444242227] [2023-04-02 00:59:23,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 00:59:23,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:23,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:59:23,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 00:59:23,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 00:59:23,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 00:59:23,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 00:59:23,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 45 conjunts are in the unsatisfiable core [2023-04-02 00:59:23,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:59:23,181 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:59:23,220 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 00:59:23,221 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:59:23,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 00:59:23,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-04-02 00:59:23,325 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-04-02 00:59:23,326 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:59:23,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 00:59:23,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 00:59:23,387 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:59:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:23,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:59:23,438 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array Int Int))) (not (= (select (select (store |c_#memory_int| c_main_~p~0.base v_ArrVal_628) c_main_~a~0.base) c_main_~a~0.offset) 1))) is different from false [2023-04-02 00:59:23,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:23,542 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 27 treesize of output 33 [2023-04-02 00:59:23,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:23,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 68 [2023-04-02 00:59:23,557 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 52 treesize of output 48 [2023-04-02 00:59:23,561 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 48 treesize of output 46 [2023-04-02 00:59:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-04-02 00:59:23,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444242227] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 00:59:23,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 00:59:23,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2023-04-02 00:59:23,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799747741] [2023-04-02 00:59:23,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 00:59:23,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-02 00:59:23,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:23,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-02 00:59:23,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=425, Unknown=2, NotChecked=42, Total=552 [2023-04-02 00:59:23,749 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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:59:30,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-04-02 00:59:32,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-04-02 00:59:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:33,142 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2023-04-02 00:59:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-04-02 00:59:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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 41 [2023-04-02 00:59:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:33,143 INFO L225 Difference]: With dead ends: 130 [2023-04-02 00:59:33,143 INFO L226 Difference]: Without dead ends: 122 [2023-04-02 00:59:33,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=337, Invalid=1292, Unknown=15, NotChecked=78, Total=1722 [2023-04-02 00:59:33,144 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 176 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 38 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:33,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 56 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 796 Invalid, 18 Unknown, 95 Unchecked, 4.6s Time] [2023-04-02 00:59:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-04-02 00:59:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2023-04-02 00:59:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 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:59:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2023-04-02 00:59:33,151 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 41 [2023-04-02 00:59:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:33,151 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2023-04-02 00:59:33,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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:59:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2023-04-02 00:59:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-02 00:59:33,151 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:33,152 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:33,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-02 00:59:33,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:33,357 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:33,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:33,358 INFO L85 PathProgramCache]: Analyzing trace with hash -367601020, now seen corresponding path program 2 times [2023-04-02 00:59:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:33,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044758793] [2023-04-02 00:59:33,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:59:34,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:34,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044758793] [2023-04-02 00:59:34,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044758793] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:59:34,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362763413] [2023-04-02 00:59:34,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 00:59:34,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:34,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:59:34,026 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 00:59:34,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 00:59:34,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 00:59:34,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 00:59:34,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 71 conjunts are in the unsatisfiable core [2023-04-02 00:59:34,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:59:34,179 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:59:34,216 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 00:59:34,216 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:59:34,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 00:59:34,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 00:59:34,311 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 00:59:34,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-04-02 00:59:34,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-02 00:59:34,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 00:59:34,336 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 00:59:34,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-04-02 00:59:34,352 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-04-02 00:59:34,352 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 20 treesize of output 22 [2023-04-02 00:59:34,427 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-04-02 00:59:34,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 103 [2023-04-02 00:59:34,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2023-04-02 00:59:34,438 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 115 treesize of output 93 [2023-04-02 00:59:34,540 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-04-02 00:59:34,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 133 [2023-04-02 00:59:34,557 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-04-02 00:59:34,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 128 [2023-04-02 00:59:34,566 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 55 treesize of output 40 [2023-04-02 00:59:34,702 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-04-02 00:59:34,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 50 [2023-04-02 00:59:34,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2023-04-02 00:59:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:34,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:59:34,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:34,952 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 75 treesize of output 79 [2023-04-02 00:59:34,974 INFO L321 Elim1Store]: treesize reduction 4, result has 91.7 percent of original size [2023-04-02 00:59:34,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2090 treesize of output 2020 [2023-04-02 00:59:35,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:35,027 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 414 treesize of output 382 [2023-04-02 00:59:35,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-04-02 00:59:35,307 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 49 treesize of output 37 [2023-04-02 00:59:35,426 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 56 treesize of output 40 [2023-04-02 00:59:36,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,161 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 51 treesize of output 41 [2023-04-02 00:59:36,164 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:36,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 58 [2023-04-02 00:59:36,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2023-04-02 00:59:36,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,211 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 59 treesize of output 49 [2023-04-02 00:59:36,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:36,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-04-02 00:59:36,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2023-04-02 00:59:36,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,248 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 29 treesize of output 30 [2023-04-02 00:59:36,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 207 [2023-04-02 00:59:36,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,267 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 29 treesize of output 30 [2023-04-02 00:59:36,270 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:36,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-04-02 00:59:36,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-04-02 00:59:36,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2023-04-02 00:59:36,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,340 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 29 treesize of output 30 [2023-04-02 00:59:36,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 128 [2023-04-02 00:59:36,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,357 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 29 treesize of output 30 [2023-04-02 00:59:36,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2023-04-02 00:59:36,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2023-04-02 00:59:36,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 113 [2023-04-02 00:59:36,401 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 50 treesize of output 42 [2023-04-02 00:59:36,408 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 50 treesize of output 42 [2023-04-02 00:59:36,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,532 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 29 treesize of output 30 [2023-04-02 00:59:36,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 128 [2023-04-02 00:59:36,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,550 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 29 treesize of output 30 [2023-04-02 00:59:36,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:36,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-04-02 00:59:36,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 75 [2023-04-02 00:59:36,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2023-04-02 00:59:36,594 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 50 treesize of output 42 [2023-04-02 00:59:36,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,644 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 59 treesize of output 49 [2023-04-02 00:59:36,645 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:36,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-04-02 00:59:36,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2023-04-02 00:59:36,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,680 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 30 treesize of output 31 [2023-04-02 00:59:36,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,688 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 46 treesize of output 47 [2023-04-02 00:59:36,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 128 [2023-04-02 00:59:36,705 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 74 treesize of output 66 [2023-04-02 00:59:36,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 75 [2023-04-02 00:59:36,726 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:36,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-04-02 00:59:36,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 79 [2023-04-02 00:59:36,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,851 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 51 treesize of output 41 [2023-04-02 00:59:36,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:36,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 58 [2023-04-02 00:59:36,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2023-04-02 00:59:36,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,903 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 29 treesize of output 30 [2023-04-02 00:59:36,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 135 [2023-04-02 00:59:36,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,923 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 29 treesize of output 30 [2023-04-02 00:59:36,932 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:36,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-04-02 00:59:36,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-04-02 00:59:36,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:36,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2023-04-02 00:59:37,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:37,005 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 30 treesize of output 31 [2023-04-02 00:59:37,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:37,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 221 [2023-04-02 00:59:37,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:37,025 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 34 treesize of output 35 [2023-04-02 00:59:37,030 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:37,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:37,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-04-02 00:59:37,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:37,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2023-04-02 00:59:37,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:37,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2023-04-02 00:59:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:37,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362763413] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 00:59:37,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 00:59:37,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 29 [2023-04-02 00:59:37,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112625194] [2023-04-02 00:59:37,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 00:59:37,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-02 00:59:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:37,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-02 00:59:37,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2023-04-02 00:59:37,954 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 28 states have internal predecessors, (79), 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:59:41,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-04-02 00:59:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:41,981 INFO L93 Difference]: Finished difference Result 142 states and 186 transitions. [2023-04-02 00:59:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-02 00:59:41,982 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 28 states have internal predecessors, (79), 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 41 [2023-04-02 00:59:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:41,982 INFO L225 Difference]: With dead ends: 142 [2023-04-02 00:59:41,982 INFO L226 Difference]: Without dead ends: 138 [2023-04-02 00:59:41,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=394, Invalid=2056, Unknown=0, NotChecked=0, Total=2450 [2023-04-02 00:59:41,983 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 369 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 59 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:41,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 57 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 955 Invalid, 4 Unknown, 0 Unchecked, 3.2s Time] [2023-04-02 00:59:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-04-02 00:59:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2023-04-02 00:59:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.358974358974359) internal successors, (159), 117 states have internal predecessors, (159), 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:59:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2023-04-02 00:59:41,993 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 41 [2023-04-02 00:59:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:41,993 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2023-04-02 00:59:41,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 28 states have internal predecessors, (79), 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:59:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2023-04-02 00:59:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-02 00:59:41,993 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:41,993 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:41,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-02 00:59:42,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:42,199 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:42,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1708179972, now seen corresponding path program 2 times [2023-04-02 00:59:42,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:42,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536198496] [2023-04-02 00:59:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:42,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:42,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:59:42,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:42,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536198496] [2023-04-02 00:59:42,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536198496] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:59:42,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622505991] [2023-04-02 00:59:42,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 00:59:42,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:42,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:59:42,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 00:59:42,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 00:59:42,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 00:59:42,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 00:59:42,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 68 conjunts are in the unsatisfiable core [2023-04-02 00:59:42,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:59:42,921 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:59:42,970 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 00:59:42,971 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:59:43,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 00:59:43,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 00:59:43,057 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 00:59:43,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-04-02 00:59:43,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-02 00:59:43,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 00:59:43,077 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 00:59:43,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-02 00:59:43,095 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 00:59:43,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2023-04-02 00:59:43,163 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-04-02 00:59:43,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 67 [2023-04-02 00:59:43,173 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 33 treesize of output 26 [2023-04-02 00:59:43,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2023-04-02 00:59:43,283 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-04-02 00:59:43,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 91 [2023-04-02 00:59:43,300 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-04-02 00:59:43,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 48 [2023-04-02 00:59:43,314 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-04-02 00:59:43,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 38 [2023-04-02 00:59:43,333 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 27 treesize of output 21 [2023-04-02 00:59:43,411 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-04-02 00:59:43,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 45 [2023-04-02 00:59:43,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2023-04-02 00:59:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:43,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:59:43,645 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_863 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ c_main_~a~0.offset 4))) (select (select (store |c_#memory_int| c_main_~p~0.base (store (select |c_#memory_int| c_main_~p~0.base) c_main_~p~0.offset 3)) (select (select (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_864) c_main_~a~0.base) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_ArrVal_863) c_main_~a~0.base) .cse1))))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2023-04-02 00:59:43,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:43,845 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 151 treesize of output 149 [2023-04-02 00:59:43,850 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 2605 treesize of output 2441 [2023-04-02 00:59:43,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:43,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 908 treesize of output 854 [2023-04-02 00:59:44,025 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 49 treesize of output 37 [2023-04-02 00:59:44,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-04-02 00:59:44,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,246 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 29 treesize of output 30 [2023-04-02 00:59:44,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,252 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 33 treesize of output 34 [2023-04-02 00:59:44,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2023-04-02 00:59:44,270 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 70 treesize of output 62 [2023-04-02 00:59:44,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2023-04-02 00:59:44,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 101 [2023-04-02 00:59:44,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 105 [2023-04-02 00:59:44,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-04-02 00:59:44,466 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,466 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 51 treesize of output 41 [2023-04-02 00:59:44,469 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:44,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-04-02 00:59:44,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2023-04-02 00:59:44,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,497 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 63 treesize of output 53 [2023-04-02 00:59:44,499 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:44,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2023-04-02 00:59:44,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 37 [2023-04-02 00:59:44,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,544 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 29 treesize of output 30 [2023-04-02 00:59:44,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,549 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 29 treesize of output 30 [2023-04-02 00:59:44,552 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:44,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-04-02 00:59:44,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 00:59:44,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-04-02 00:59:44,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-04-02 00:59:44,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:44,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-04-02 00:59:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-04-02 00:59:44,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622505991] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 00:59:44,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 00:59:44,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2023-04-02 00:59:44,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160348243] [2023-04-02 00:59:44,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 00:59:44,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-02 00:59:44,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 00:59:44,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-02 00:59:44,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1001, Unknown=7, NotChecked=64, Total=1190 [2023-04-02 00:59:44,953 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 35 states, 35 states have (on average 2.6) internal successors, (91), 34 states have internal predecessors, (91), 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:59:45,610 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| c_main_~a~0.base)) (.cse1 (+ c_main_~a~0.offset 4))) (let ((.cse4 (select |c_#memory_int| c_main_~p~0.base)) (.cse0 (select |c_#memory_$Pointer$.offset| c_main_~a~0.base)) (.cse7 (select .cse8 .cse1))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= c_main_~p~0.offset 0) (not (= c_main_~p~0.base c_main_~a~0.base)) (= (select .cse0 .cse1) 0) (= c_main_~a~0.offset 0) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_859 Int) (v_ArrVal_863 (Array Int Int))) (let ((.cse2 (let ((.cse5 (+ c_main_~p~0.offset 4))) (select (select (let ((.cse3 (store |c_#memory_int| c_main_~p~0.base (store .cse4 .cse5 v_ArrVal_859)))) (store .cse3 c_main_~t~0.base (store (select .cse3 c_main_~t~0.base) c_main_~t~0.offset 3))) (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base (store (select |c_#memory_$Pointer$.base| c_main_~p~0.base) .cse5 c_main_~t~0.base)) c_main_~t~0.base v_ArrVal_864) c_main_~a~0.base) .cse1)) (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~p~0.base) .cse5 c_main_~t~0.offset)) c_main_~t~0.base v_ArrVal_863) c_main_~a~0.base) .cse1))))) (or (= .cse2 1) (= .cse2 3)))) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_863 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| c_main_~p~0.base (store .cse4 c_main_~p~0.offset 3)) (select (select (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_864) c_main_~a~0.base) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_ArrVal_863) c_main_~a~0.base) .cse1)))) (or (= 3 .cse6) (= .cse6 1)))) (= c_main_~p~0.offset (select .cse0 4)) (<= c_main_~root~0.offset 0) (not (= .cse7 c_main_~a~0.base)) (= (select |c_#valid| c_main_~a~0.base) 1) (= .cse7 c_main_~p~0.base) (= c_main_~p~0.base (select .cse8 4)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (<= 0 c_main_~root~0.offset) (= (select |c_#valid| c_main_~p~0.base) 1)))) is different from false [2023-04-02 00:59:45,700 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| c_main_~a~0.base)) (.cse1 (+ c_main_~a~0.offset 4))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| c_main_~a~0.base)) (.cse5 (select .cse6 .cse1))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= c_main_~p~0.offset 0) (not (= c_main_~p~0.base c_main_~a~0.base)) (= (select .cse0 .cse1) 0) (= c_main_~a~0.offset 0) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_859 Int) (v_ArrVal_863 (Array Int Int))) (let ((.cse2 (let ((.cse4 (+ c_main_~p~0.offset 4))) (select (select (let ((.cse3 (store |c_#memory_int| c_main_~p~0.base (store (select |c_#memory_int| c_main_~p~0.base) .cse4 v_ArrVal_859)))) (store .cse3 c_main_~t~0.base (store (select .cse3 c_main_~t~0.base) c_main_~t~0.offset 3))) (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base (store (select |c_#memory_$Pointer$.base| c_main_~p~0.base) .cse4 c_main_~t~0.base)) c_main_~t~0.base v_ArrVal_864) c_main_~a~0.base) .cse1)) (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~p~0.base) .cse4 c_main_~t~0.offset)) c_main_~t~0.base v_ArrVal_863) c_main_~a~0.base) .cse1))))) (or (= .cse2 1) (= .cse2 3)))) (= c_main_~p~0.offset (select .cse0 4)) (<= c_main_~root~0.offset 0) (not (= .cse5 c_main_~a~0.base)) (= (select |c_#valid| c_main_~a~0.base) 1) (= .cse5 c_main_~p~0.base) (= c_main_~p~0.base (select .cse6 4)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (<= 0 c_main_~root~0.offset) (= (select |c_#valid| c_main_~p~0.base) 1)))) is different from false [2023-04-02 00:59:49,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-04-02 00:59:51,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-04-02 00:59:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 00:59:52,321 INFO L93 Difference]: Finished difference Result 171 states and 221 transitions. [2023-04-02 00:59:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-04-02 00:59:52,321 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 34 states have internal predecessors, (91), 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 41 [2023-04-02 00:59:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 00:59:52,323 INFO L225 Difference]: With dead ends: 171 [2023-04-02 00:59:52,323 INFO L226 Difference]: Without dead ends: 161 [2023-04-02 00:59:52,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=555, Invalid=3596, Unknown=21, NotChecked=384, Total=4556 [2023-04-02 00:59:52,324 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 267 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 58 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-04-02 00:59:52,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 88 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1542 Invalid, 10 Unknown, 185 Unchecked, 5.5s Time] [2023-04-02 00:59:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-04-02 00:59:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2023-04-02 00:59:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 130 states have internal predecessors, (175), 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:59:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2023-04-02 00:59:52,346 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 41 [2023-04-02 00:59:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 00:59:52,346 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2023-04-02 00:59:52,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 34 states have internal predecessors, (91), 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:59:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2023-04-02 00:59:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-02 00:59:52,347 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 00:59:52,347 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 00:59:52,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-04-02 00:59:52,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-02 00:59:52,552 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 00:59:52,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 00:59:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1028581505, now seen corresponding path program 3 times [2023-04-02 00:59:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 00:59:52,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622481218] [2023-04-02 00:59:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 00:59:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 00:59:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 00:59:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 00:59:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 00:59:53,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 00:59:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622481218] [2023-04-02 00:59:53,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622481218] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 00:59:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355604882] [2023-04-02 00:59:53,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 00:59:53,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 00:59:53,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 00:59:53,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 00:59:53,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 00:59:53,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 00:59:53,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 00:59:53,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 67 conjunts are in the unsatisfiable core [2023-04-02 00:59:53,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 00:59:53,437 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:59:53,475 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 00:59:53,475 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:59:53,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 00:59:53,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 00:59:53,567 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 00:59:53,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-04-02 00:59:53,581 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-04-02 00:59:53,581 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 20 treesize of output 22 [2023-04-02 00:59:53,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 00:59:53,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 00:59:53,655 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-04-02 00:59:53,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 75 [2023-04-02 00:59:53,660 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 100 treesize of output 82 [2023-04-02 00:59:53,732 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-04-02 00:59:53,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 120 [2023-04-02 00:59:53,754 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-04-02 00:59:53,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 115 [2023-04-02 00:59:53,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-04-02 00:59:53,877 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-04-02 00:59:53,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 39 [2023-04-02 00:59:53,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 00:59:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 00:59:53,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 00:59:53,969 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 187 treesize of output 129 [2023-04-02 00:59:53,975 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~a~0.offset 4))) (and (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (= c_main_~p~0.base (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_975))) (select .cse0 (select (select .cse0 c_main_~a~0.base) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_ArrVal_978) c_main_~a~0.base) .cse1) 4)))) (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_ArrVal_978))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_975) c_main_~a~0.base) .cse1)) (+ (select (select .cse2 c_main_~a~0.base) .cse1) 4))) c_main_~p~0.offset)))) is different from false [2023-04-02 00:59:54,160 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:54,161 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 109 treesize of output 103 [2023-04-02 00:59:54,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:54,168 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 122 treesize of output 116 [2023-04-02 00:59:54,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:54,312 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 85 treesize of output 86 [2023-04-02 00:59:54,317 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:54,317 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 99 treesize of output 90 [2023-04-02 00:59:54,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:54,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 243 [2023-04-02 00:59:54,870 INFO L321 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2023-04-02 00:59:54,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 2888 treesize of output 3071 [2023-04-02 00:59:55,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:55,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 688 treesize of output 608 [2023-04-02 00:59:55,032 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 616 treesize of output 548 [2023-04-02 00:59:55,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:55,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 566 treesize of output 422 [2023-04-02 00:59:55,151 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 00:59:55,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 183