./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 00:01:58,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 00:01:58,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 00:01:58,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 00:01:58,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 00:01:58,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 00:01:58,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 00:01:58,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 00:01:58,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 00:01:58,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 00:01:58,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 00:01:58,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 00:01:58,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 00:01:58,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 00:01:58,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 00:01:58,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 00:01:58,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 00:01:58,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 00:01:58,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 00:01:58,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 00:01:58,778 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 00:01:58,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 00:01:58,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 00:01:58,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 00:01:58,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 00:01:58,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 00:01:58,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 00:01:58,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 00:01:58,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 00:01:58,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 00:01:58,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 00:01:58,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 00:01:58,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 00:01:58,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 00:01:58,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 00:01:58,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 00:01:58,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 00:01:58,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 00:01:58,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 00:01:58,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 00:01:58,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 00:01:58,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 00:01:58,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 00:01:58,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 00:01:58,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 00:01:58,835 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 00:01:58,836 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 00:01:58,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 00:01:58,837 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 00:01:58,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 00:01:58,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 00:01:58,837 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 00:01:58,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 00:01:58,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 00:01:58,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 00:01:58,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 00:01:58,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 00:01:58,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 00:01:58,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 00:01:58,840 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 00:01:58,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 00:01:58,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 00:01:58,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 00:01:58,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 00:01:58,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:01:58,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 00:01:58,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 00:01:58,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 00:01:58,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 00:01:58,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 00:01:58,842 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 00:01:58,842 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 00:01:58,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 00:01:58,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e [2022-07-20 00:01:59,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 00:01:59,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 00:01:59,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 00:01:59,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 00:01:59,152 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 00:01:59,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-20 00:01:59,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbff553fb/e9664818395b46f28ae4b3b0267efa97/FLAG6b7cd4bae [2022-07-20 00:01:59,951 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 00:01:59,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-20 00:01:59,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbff553fb/e9664818395b46f28ae4b3b0267efa97/FLAG6b7cd4bae [2022-07-20 00:02:00,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbff553fb/e9664818395b46f28ae4b3b0267efa97 [2022-07-20 00:02:00,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 00:02:00,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 00:02:00,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 00:02:00,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 00:02:00,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 00:02:00,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:02:00" (1/1) ... [2022-07-20 00:02:00,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723ee0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:00, skipping insertion in model container [2022-07-20 00:02:00,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:02:00" (1/1) ... [2022-07-20 00:02:00,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 00:02:00,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 00:02:00,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-07-20 00:02:01,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:02:01,607 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 00:02:01,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-07-20 00:02:01,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:02:01,978 INFO L208 MainTranslator]: Completed translation [2022-07-20 00:02:01,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01 WrapperNode [2022-07-20 00:02:01,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 00:02:01,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 00:02:01,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 00:02:01,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 00:02:01,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (1/1) ... [2022-07-20 00:02:02,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (1/1) ... [2022-07-20 00:02:02,139 INFO L137 Inliner]: procedures = 184, calls = 828, calls flagged for inlining = 92, calls inlined = 90, statements flattened = 3190 [2022-07-20 00:02:02,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 00:02:02,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 00:02:02,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 00:02:02,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 00:02:02,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (1/1) ... [2022-07-20 00:02:02,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (1/1) ... [2022-07-20 00:02:02,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (1/1) ... [2022-07-20 00:02:02,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (1/1) ... [2022-07-20 00:02:02,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (1/1) ... [2022-07-20 00:02:02,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (1/1) ... [2022-07-20 00:02:02,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (1/1) ... [2022-07-20 00:02:02,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 00:02:02,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 00:02:02,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 00:02:02,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 00:02:02,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (1/1) ... [2022-07-20 00:02:02,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:02:02,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:02:02,396 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) [2022-07-20 00:02:02,416 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 [2022-07-20 00:02:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-20 00:02:02,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-20 00:02:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-07-20 00:02:02,440 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-07-20 00:02:02,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 00:02:02,440 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-20 00:02:02,440 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-20 00:02:02,440 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-20 00:02:02,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 00:02:02,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 00:02:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 00:02:02,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 00:02:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 00:02:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-20 00:02:02,441 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-20 00:02:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-20 00:02:02,441 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-20 00:02:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-20 00:02:02,442 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-20 00:02:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 00:02:02,442 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 00:02:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-20 00:02:02,442 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-20 00:02:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 00:02:02,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 00:02:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-20 00:02:02,443 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-20 00:02:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-20 00:02:02,443 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-20 00:02:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 00:02:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 00:02:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-20 00:02:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-20 00:02:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 00:02:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-20 00:02:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-20 00:02:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 00:02:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 00:02:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-20 00:02:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-20 00:02:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-20 00:02:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-20 00:02:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-20 00:02:02,446 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-20 00:02:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-20 00:02:02,446 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-20 00:02:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 00:02:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-07-20 00:02:02,446 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-07-20 00:02:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-20 00:02:02,447 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-20 00:02:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-20 00:02:02,447 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-20 00:02:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 00:02:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-20 00:02:02,448 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-20 00:02:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-20 00:02:02,449 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-20 00:02:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 00:02:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 00:02:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 00:02:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-20 00:02:02,450 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-20 00:02:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-07-20 00:02:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-07-20 00:02:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-20 00:02:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-20 00:02:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-07-20 00:02:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-07-20 00:02:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 00:02:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-20 00:02:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-20 00:02:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-20 00:02:02,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-20 00:02:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-20 00:02:02,452 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-20 00:02:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-20 00:02:02,453 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-20 00:02:02,453 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-20 00:02:02,453 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-20 00:02:02,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 00:02:02,453 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-20 00:02:02,453 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-20 00:02:02,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 00:02:02,454 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-20 00:02:02,454 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-20 00:02:02,454 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-20 00:02:02,454 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-20 00:02:02,454 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-07-20 00:02:02,454 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-07-20 00:02:02,455 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-20 00:02:02,455 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-20 00:02:02,455 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-20 00:02:02,455 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-20 00:02:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-07-20 00:02:02,456 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-07-20 00:02:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-20 00:02:02,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-20 00:02:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-20 00:02:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-20 00:02:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-20 00:02:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-20 00:02:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-20 00:02:02,458 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-20 00:02:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-20 00:02:02,458 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-20 00:02:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 00:02:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-20 00:02:02,458 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-20 00:02:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-20 00:02:02,459 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-20 00:02:02,459 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-20 00:02:02,459 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-20 00:02:02,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 00:02:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 00:02:02,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 00:02:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 00:02:02,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 00:02:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-20 00:02:02,463 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-20 00:02:02,463 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-20 00:02:02,463 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-20 00:02:03,073 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 00:02:03,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 00:02:03,294 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 00:02:05,575 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 00:02:05,595 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 00:02:05,595 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 00:02:05,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:02:05 BoogieIcfgContainer [2022-07-20 00:02:05,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 00:02:05,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 00:02:05,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 00:02:05,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 00:02:05,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:02:00" (1/3) ... [2022-07-20 00:02:05,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470655f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:02:05, skipping insertion in model container [2022-07-20 00:02:05,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:02:01" (2/3) ... [2022-07-20 00:02:05,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470655f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:02:05, skipping insertion in model container [2022-07-20 00:02:05,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:02:05" (3/3) ... [2022-07-20 00:02:05,610 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-20 00:02:05,656 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 00:02:05,656 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 00:02:05,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 00:02:05,745 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2bc3b954, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@548066ce [2022-07-20 00:02:05,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 00:02:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 1090 states, 808 states have (on average 1.431930693069307) internal successors, (1157), 841 states have internal predecessors, (1157), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2022-07-20 00:02:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 00:02:05,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:02:05,773 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:02:05,774 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:02:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:02:05,779 INFO L85 PathProgramCache]: Analyzing trace with hash 385485251, now seen corresponding path program 1 times [2022-07-20 00:02:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:02:05,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430740035] [2022-07-20 00:02:05,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:02:05,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:02:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:06,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:06,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:02:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:02:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:06,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:02:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:06,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:02:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:06,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:02:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:06,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:02:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-20 00:02:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:02:06,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430740035] [2022-07-20 00:02:06,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430740035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:02:06,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:02:06,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:02:06,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412615767] [2022-07-20 00:02:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:02:06,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:02:06,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:02:06,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:02:06,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 00:02:06,322 INFO L87 Difference]: Start difference. First operand has 1090 states, 808 states have (on average 1.431930693069307) internal successors, (1157), 841 states have internal predecessors, (1157), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-20 00:02:08,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:02:11,285 INFO L93 Difference]: Finished difference Result 2928 states and 4383 transitions. [2022-07-20 00:02:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:02:11,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-07-20 00:02:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:02:11,318 INFO L225 Difference]: With dead ends: 2928 [2022-07-20 00:02:11,319 INFO L226 Difference]: Without dead ends: 1758 [2022-07-20 00:02:11,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:02:11,333 INFO L413 NwaCegarLoop]: 1698 mSDtfsCounter, 1444 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 499 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 3242 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:02:11,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 3242 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 1337 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-07-20 00:02:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2022-07-20 00:02:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1599. [2022-07-20 00:02:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.403225806451613) internal successors, (1653), 1211 states have internal predecessors, (1653), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 00:02:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2318 transitions. [2022-07-20 00:02:11,503 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2318 transitions. Word has length 63 [2022-07-20 00:02:11,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:02:11,504 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2318 transitions. [2022-07-20 00:02:11,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-20 00:02:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2318 transitions. [2022-07-20 00:02:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-20 00:02:11,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:02:11,515 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:02:11,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 00:02:11,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:02:11,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:02:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1548414277, now seen corresponding path program 1 times [2022-07-20 00:02:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:02:11,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534153309] [2022-07-20 00:02:11,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:02:11,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:02:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:02:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:02:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:02:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:02:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:02:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:02:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:02:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:02:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 00:02:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 00:02:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-20 00:02:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:02:11,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534153309] [2022-07-20 00:02:11,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534153309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:02:11,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:02:11,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:02:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863370672] [2022-07-20 00:02:11,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:02:11,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:02:11,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:02:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:02:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:02:11,811 INFO L87 Difference]: Start difference. First operand 1599 states and 2318 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-20 00:02:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:02:14,502 INFO L93 Difference]: Finished difference Result 3364 states and 4935 transitions. [2022-07-20 00:02:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:02:14,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-07-20 00:02:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:02:14,517 INFO L225 Difference]: With dead ends: 3364 [2022-07-20 00:02:14,523 INFO L226 Difference]: Without dead ends: 1789 [2022-07-20 00:02:14,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:02:14,537 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 1824 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:02:14,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 2561 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-20 00:02:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-07-20 00:02:14,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1599. [2022-07-20 00:02:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.401528013582343) internal successors, (1651), 1211 states have internal predecessors, (1651), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 00:02:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2316 transitions. [2022-07-20 00:02:14,653 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2316 transitions. Word has length 104 [2022-07-20 00:02:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:02:14,654 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2316 transitions. [2022-07-20 00:02:14,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-20 00:02:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2316 transitions. [2022-07-20 00:02:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-20 00:02:14,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:02:14,665 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:02:14,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 00:02:14,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:02:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:02:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash -480171833, now seen corresponding path program 1 times [2022-07-20 00:02:14,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:02:14,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942855407] [2022-07-20 00:02:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:02:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:02:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:02:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:02:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:02:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:02:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:02:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:02:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:02:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:02:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 00:02:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 00:02:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-20 00:02:14,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:02:14,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942855407] [2022-07-20 00:02:14,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942855407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:02:14,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:02:14,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:02:14,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95355154] [2022-07-20 00:02:14,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:02:14,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:02:14,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:02:14,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:02:14,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:02:14,897 INFO L87 Difference]: Start difference. First operand 1599 states and 2316 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 00:02:16,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:02:19,942 INFO L93 Difference]: Finished difference Result 3368 states and 4935 transitions. [2022-07-20 00:02:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:02:19,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2022-07-20 00:02:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:02:19,956 INFO L225 Difference]: With dead ends: 3368 [2022-07-20 00:02:19,957 INFO L226 Difference]: Without dead ends: 1789 [2022-07-20 00:02:19,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:02:19,966 INFO L413 NwaCegarLoop]: 1485 mSDtfsCounter, 558 mSDsluCounter, 2889 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 4374 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-20 00:02:19,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 4374 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-20 00:02:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-07-20 00:02:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1599. [2022-07-20 00:02:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.399830220713073) internal successors, (1649), 1211 states have internal predecessors, (1649), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 00:02:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2314 transitions. [2022-07-20 00:02:20,045 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2314 transitions. Word has length 104 [2022-07-20 00:02:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:02:20,045 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2314 transitions. [2022-07-20 00:02:20,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 00:02:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2314 transitions. [2022-07-20 00:02:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 00:02:20,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:02:20,054 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:02:20,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 00:02:20,054 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:02:20,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:02:20,055 INFO L85 PathProgramCache]: Analyzing trace with hash -899814917, now seen corresponding path program 1 times [2022-07-20 00:02:20,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:02:20,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782450730] [2022-07-20 00:02:20,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:02:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:02:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:02:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:02:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:02:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:02:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:02:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:02:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:02:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:02:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:02:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:02:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-20 00:02:20,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:02:20,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782450730] [2022-07-20 00:02:20,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782450730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:02:20,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:02:20,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:02:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269054405] [2022-07-20 00:02:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:02:20,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:02:20,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:02:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:02:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:02:20,299 INFO L87 Difference]: Start difference. First operand 1599 states and 2314 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-20 00:02:22,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:02:24,858 INFO L93 Difference]: Finished difference Result 2380 states and 3634 transitions. [2022-07-20 00:02:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:02:24,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2022-07-20 00:02:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:02:24,873 INFO L225 Difference]: With dead ends: 2380 [2022-07-20 00:02:24,873 INFO L226 Difference]: Without dead ends: 2377 [2022-07-20 00:02:24,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:02:24,876 INFO L413 NwaCegarLoop]: 2078 mSDtfsCounter, 1807 mSDsluCounter, 3116 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 732 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 5194 SdHoareTripleChecker+Invalid, 2822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:02:24,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1929 Valid, 5194 Invalid, 2822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 2089 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-07-20 00:02:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-07-20 00:02:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1601. [2022-07-20 00:02:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1180 states have (on average 1.3991525423728814) internal successors, (1651), 1213 states have internal predecessors, (1651), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 00:02:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2316 transitions. [2022-07-20 00:02:24,982 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2316 transitions. Word has length 107 [2022-07-20 00:02:24,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:02:24,983 INFO L495 AbstractCegarLoop]: Abstraction has 1601 states and 2316 transitions. [2022-07-20 00:02:24,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-20 00:02:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2316 transitions. [2022-07-20 00:02:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 00:02:24,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:02:24,992 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:02:24,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 00:02:24,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:02:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:02:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash 578773151, now seen corresponding path program 1 times [2022-07-20 00:02:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:02:24,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140338757] [2022-07-20 00:02:24,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:02:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:02:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:02:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:02:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:02:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:02:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:02:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:02:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:02:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:02:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:02:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:02:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:02:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-20 00:02:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:02:25,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140338757] [2022-07-20 00:02:25,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140338757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:02:25,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:02:25,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:02:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069681585] [2022-07-20 00:02:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:02:25,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:02:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:02:25,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:02:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:02:25,226 INFO L87 Difference]: Start difference. First operand 1601 states and 2316 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-20 00:02:27,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:02:30,363 INFO L93 Difference]: Finished difference Result 3957 states and 5919 transitions. [2022-07-20 00:02:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:02:30,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2022-07-20 00:02:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:02:30,380 INFO L225 Difference]: With dead ends: 3957 [2022-07-20 00:02:30,380 INFO L226 Difference]: Without dead ends: 2380 [2022-07-20 00:02:30,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:02:30,389 INFO L413 NwaCegarLoop]: 1838 mSDtfsCounter, 2448 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 730 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2703 SdHoareTripleChecker+Valid, 4172 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 730 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-20 00:02:30,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2703 Valid, 4172 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [730 Valid, 2136 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2022-07-20 00:02:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-07-20 00:02:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1602. [2022-07-20 00:02:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1181 states have (on average 1.3988145639288738) internal successors, (1652), 1214 states have internal predecessors, (1652), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 00:02:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2317 transitions. [2022-07-20 00:02:30,473 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2317 transitions. Word has length 117 [2022-07-20 00:02:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:02:30,475 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2317 transitions. [2022-07-20 00:02:30,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-20 00:02:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2317 transitions. [2022-07-20 00:02:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-20 00:02:30,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:02:30,481 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:02:30,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 00:02:30,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:02:30,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:02:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1349496606, now seen corresponding path program 1 times [2022-07-20 00:02:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:02:30,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985020153] [2022-07-20 00:02:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:02:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:02:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:02:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:02:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:02:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:02:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:02:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:02:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:02:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:02:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:02:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:02:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:02:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-20 00:02:30,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:02:30,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985020153] [2022-07-20 00:02:30,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985020153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:02:30,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:02:30,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:02:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035741423] [2022-07-20 00:02:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:02:30,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:02:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:02:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:02:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:02:30,729 INFO L87 Difference]: Start difference. First operand 1602 states and 2317 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 00:02:32,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:34,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:37,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:38,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:41,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:42,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:02:45,836 INFO L93 Difference]: Finished difference Result 3312 states and 5203 transitions. [2022-07-20 00:02:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 00:02:45,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2022-07-20 00:02:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:02:45,855 INFO L225 Difference]: With dead ends: 3312 [2022-07-20 00:02:45,855 INFO L226 Difference]: Without dead ends: 3309 [2022-07-20 00:02:45,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:02:45,858 INFO L413 NwaCegarLoop]: 2513 mSDtfsCounter, 2306 mSDsluCounter, 6385 mSDsCounter, 0 mSdLazyCounter, 3803 mSolverCounterSat, 818 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2522 SdHoareTripleChecker+Valid, 8898 SdHoareTripleChecker+Invalid, 4625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 3803 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-07-20 00:02:45,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2522 Valid, 8898 Invalid, 4625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 3803 Invalid, 4 Unknown, 0 Unchecked, 14.8s Time] [2022-07-20 00:02:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2022-07-20 00:02:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1604. [2022-07-20 00:02:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1182 states have (on average 1.398477157360406) internal successors, (1653), 1214 states have internal predecessors, (1653), 334 states have call successors, (334), 89 states have call predecessors, (334), 87 states have return successors, (333), 329 states have call predecessors, (333), 333 states have call successors, (333) [2022-07-20 00:02:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2320 transitions. [2022-07-20 00:02:45,959 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2320 transitions. Word has length 119 [2022-07-20 00:02:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:02:45,960 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 2320 transitions. [2022-07-20 00:02:45,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 00:02:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2320 transitions. [2022-07-20 00:02:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-20 00:02:45,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:02:45,968 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:02:45,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 00:02:45,968 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:02:45,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:02:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1867335849, now seen corresponding path program 1 times [2022-07-20 00:02:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:02:45,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515473641] [2022-07-20 00:02:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:02:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:02:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:02:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:02:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:02:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:02:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:02:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:02:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:02:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:02:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:02:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:02:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:02:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 00:02:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 00:02:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 00:02:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 00:02:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-20 00:02:46,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:02:46,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515473641] [2022-07-20 00:02:46,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515473641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:02:46,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:02:46,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:02:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661024812] [2022-07-20 00:02:46,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:02:46,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:02:46,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:02:46,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:02:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:02:46,231 INFO L87 Difference]: Start difference. First operand 1604 states and 2320 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-20 00:02:48,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:52,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:54,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:02:56,923 INFO L93 Difference]: Finished difference Result 3997 states and 5840 transitions. [2022-07-20 00:02:56,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:02:56,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2022-07-20 00:02:56,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:02:56,939 INFO L225 Difference]: With dead ends: 3997 [2022-07-20 00:02:56,939 INFO L226 Difference]: Without dead ends: 2417 [2022-07-20 00:02:56,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:02:56,952 INFO L413 NwaCegarLoop]: 2207 mSDtfsCounter, 2304 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 885 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:02:56,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 3568 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1148 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2022-07-20 00:02:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-07-20 00:02:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2144. [2022-07-20 00:02:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 1571 states have (on average 1.3908338637810311) internal successors, (2185), 1612 states have internal predecessors, (2185), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-20 00:02:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 3080 transitions. [2022-07-20 00:02:57,112 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 3080 transitions. Word has length 149 [2022-07-20 00:02:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:02:57,112 INFO L495 AbstractCegarLoop]: Abstraction has 2144 states and 3080 transitions. [2022-07-20 00:02:57,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-20 00:02:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 3080 transitions. [2022-07-20 00:02:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-20 00:02:57,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:02:57,125 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:02:57,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 00:02:57,126 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:02:57,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:02:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash 178046639, now seen corresponding path program 1 times [2022-07-20 00:02:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:02:57,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185534380] [2022-07-20 00:02:57,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:02:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:02:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:02:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:02:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:02:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:02:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:02:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:02:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:02:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:02:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:02:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:02:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:02:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 00:02:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 00:02:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 00:02:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 00:02:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-20 00:02:57,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:02:57,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185534380] [2022-07-20 00:02:57,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185534380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:02:57,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:02:57,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:02:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539505398] [2022-07-20 00:02:57,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:02:57,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:02:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:02:57,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:02:57,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:02:57,412 INFO L87 Difference]: Start difference. First operand 2144 states and 3080 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-20 00:03:00,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:03:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:03:02,499 INFO L93 Difference]: Finished difference Result 4586 states and 6826 transitions. [2022-07-20 00:03:02,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:03:02,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2022-07-20 00:03:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:03:02,516 INFO L225 Difference]: With dead ends: 4586 [2022-07-20 00:03:02,516 INFO L226 Difference]: Without dead ends: 3006 [2022-07-20 00:03:02,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:03:02,524 INFO L413 NwaCegarLoop]: 2008 mSDtfsCounter, 2750 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 3733 SdHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 939 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-20 00:03:02,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3000 Valid, 3733 Invalid, 2709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [939 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-20 00:03:02,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2022-07-20 00:03:02,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2148. [2022-07-20 00:03:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1575 states have (on average 1.3904761904761904) internal successors, (2190), 1616 states have internal predecessors, (2190), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-20 00:03:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 3085 transitions. [2022-07-20 00:03:02,687 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 3085 transitions. Word has length 151 [2022-07-20 00:03:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:03:02,688 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 3085 transitions. [2022-07-20 00:03:02,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-20 00:03:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 3085 transitions. [2022-07-20 00:03:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-20 00:03:02,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:03:02,700 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:03:02,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 00:03:02,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:03:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:03:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1182989250, now seen corresponding path program 1 times [2022-07-20 00:03:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:03:02,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763392408] [2022-07-20 00:03:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:03:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:03:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:03:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:03:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:03:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:03:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:03:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:03:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:03:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:03:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:03:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:03:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:03:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:03:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 00:03:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 00:03:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-20 00:03:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 00:03:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-20 00:03:02,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:03:02,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763392408] [2022-07-20 00:03:02,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763392408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:03:02,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:03:02,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:03:02,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149864427] [2022-07-20 00:03:02,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:03:02,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:03:02,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:03:02,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:03:02,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:03:02,911 INFO L87 Difference]: Start difference. First operand 2148 states and 3085 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 00:03:04,867 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:03:06,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:03:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:03:08,639 INFO L93 Difference]: Finished difference Result 4546 states and 6642 transitions. [2022-07-20 00:03:08,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:03:08,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 154 [2022-07-20 00:03:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:03:08,652 INFO L225 Difference]: With dead ends: 4546 [2022-07-20 00:03:08,653 INFO L226 Difference]: Without dead ends: 2422 [2022-07-20 00:03:08,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:03:08,664 INFO L413 NwaCegarLoop]: 1478 mSDtfsCounter, 551 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 265 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:03:08,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 3469 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1469 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-07-20 00:03:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2022-07-20 00:03:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2148. [2022-07-20 00:03:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1575 states have (on average 1.3847619047619049) internal successors, (2181), 1616 states have internal predecessors, (2181), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-20 00:03:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 3076 transitions. [2022-07-20 00:03:08,853 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 3076 transitions. Word has length 154 [2022-07-20 00:03:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:03:08,854 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 3076 transitions. [2022-07-20 00:03:08,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 00:03:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 3076 transitions. [2022-07-20 00:03:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-20 00:03:08,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:03:08,866 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:03:08,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 00:03:08,867 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:03:08,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:03:08,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1835092685, now seen corresponding path program 1 times [2022-07-20 00:03:08,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:03:08,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317302599] [2022-07-20 00:03:08,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:03:08,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:03:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:03:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:03:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:03:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:03:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:03:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:03:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:03:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:03:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:03:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:03:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:03:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:03:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 00:03:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 00:03:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 00:03:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 00:03:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-20 00:03:09,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:03:09,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317302599] [2022-07-20 00:03:09,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317302599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:03:09,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711828312] [2022-07-20 00:03:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:03:09,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:03:09,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:03:09,131 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) [2022-07-20 00:03:09,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 00:03:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:09,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 00:03:09,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:03:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-20 00:03:09,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:03:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-20 00:03:10,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711828312] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:03:10,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 00:03:10,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2022-07-20 00:03:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082712458] [2022-07-20 00:03:10,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 00:03:10,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 00:03:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:03:10,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 00:03:10,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-20 00:03:10,130 INFO L87 Difference]: Start difference. First operand 2148 states and 3076 transitions. Second operand has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2022-07-20 00:03:12,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:03:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:03:17,036 INFO L93 Difference]: Finished difference Result 6340 states and 9749 transitions. [2022-07-20 00:03:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 00:03:17,037 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 157 [2022-07-20 00:03:17,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:03:17,059 INFO L225 Difference]: With dead ends: 6340 [2022-07-20 00:03:17,059 INFO L226 Difference]: Without dead ends: 4756 [2022-07-20 00:03:17,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-20 00:03:17,066 INFO L413 NwaCegarLoop]: 2689 mSDtfsCounter, 5996 mSDsluCounter, 4322 mSDsCounter, 0 mSdLazyCounter, 4007 mSolverCounterSat, 2156 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6366 SdHoareTripleChecker+Valid, 7011 SdHoareTripleChecker+Invalid, 6164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2156 IncrementalHoareTripleChecker+Valid, 4007 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:03:17,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6366 Valid, 7011 Invalid, 6164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2156 Valid, 4007 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-20 00:03:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2022-07-20 00:03:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 2155. [2022-07-20 00:03:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1582 states have (on average 1.384323640960809) internal successors, (2190), 1623 states have internal predecessors, (2190), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-20 00:03:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3085 transitions. [2022-07-20 00:03:17,243 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3085 transitions. Word has length 157 [2022-07-20 00:03:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:03:17,243 INFO L495 AbstractCegarLoop]: Abstraction has 2155 states and 3085 transitions. [2022-07-20 00:03:17,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2022-07-20 00:03:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3085 transitions. [2022-07-20 00:03:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-20 00:03:17,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:03:17,253 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 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, 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, 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, 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] [2022-07-20 00:03:17,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 00:03:17,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-20 00:03:17,472 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:03:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:03:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1991118289, now seen corresponding path program 1 times [2022-07-20 00:03:17,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:03:17,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394734202] [2022-07-20 00:03:17,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:03:17,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:03:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:03:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:03:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:03:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:03:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:03:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:03:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:03:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:03:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:03:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:03:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:03:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:03:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:03:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 00:03:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-20 00:03:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 00:03:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 00:03:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-20 00:03:17,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:03:17,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394734202] [2022-07-20 00:03:17,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394734202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:03:17,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454020035] [2022-07-20 00:03:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:03:17,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:03:17,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:03:17,852 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) [2022-07-20 00:03:17,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 00:03:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:18,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 00:03:18,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:03:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-20 00:03:18,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:03:18,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454020035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:03:18,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:03:18,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2022-07-20 00:03:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830944346] [2022-07-20 00:03:18,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:03:18,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:03:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:03:18,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:03:18,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-20 00:03:18,391 INFO L87 Difference]: Start difference. First operand 2155 states and 3085 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 00:03:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:03:18,890 INFO L93 Difference]: Finished difference Result 4676 states and 6864 transitions. [2022-07-20 00:03:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 00:03:18,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 166 [2022-07-20 00:03:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:03:18,918 INFO L225 Difference]: With dead ends: 4676 [2022-07-20 00:03:18,918 INFO L226 Difference]: Without dead ends: 3085 [2022-07-20 00:03:18,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-20 00:03:18,924 INFO L413 NwaCegarLoop]: 2170 mSDtfsCounter, 926 mSDsluCounter, 3624 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:03:18,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 5794 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 00:03:18,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2022-07-20 00:03:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2157. [2022-07-20 00:03:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 1584 states have (on average 1.3838383838383839) internal successors, (2192), 1625 states have internal predecessors, (2192), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-20 00:03:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3087 transitions. [2022-07-20 00:03:19,089 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3087 transitions. Word has length 166 [2022-07-20 00:03:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:03:19,090 INFO L495 AbstractCegarLoop]: Abstraction has 2157 states and 3087 transitions. [2022-07-20 00:03:19,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 00:03:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3087 transitions. [2022-07-20 00:03:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-20 00:03:19,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:03:19,099 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2022-07-20 00:03:19,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 00:03:19,315 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,SelfDestructingSolverStorable10 [2022-07-20 00:03:19,316 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:03:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:03:19,316 INFO L85 PathProgramCache]: Analyzing trace with hash -530211425, now seen corresponding path program 1 times [2022-07-20 00:03:19,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:03:19,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854022691] [2022-07-20 00:03:19,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:03:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:03:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:03:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:03:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:03:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:03:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:03:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:03:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:03:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:03:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:03:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:03:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:03:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:03:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:03:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:03:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 00:03:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 00:03:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 00:03:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 00:03:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-20 00:03:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-20 00:03:19,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:03:19,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854022691] [2022-07-20 00:03:19,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854022691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:03:19,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:03:19,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:03:19,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786811429] [2022-07-20 00:03:19,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:03:19,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:03:19,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:03:19,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:03:19,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:03:19,568 INFO L87 Difference]: Start difference. First operand 2157 states and 3087 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 00:03:22,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:03:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:03:24,882 INFO L93 Difference]: Finished difference Result 4652 states and 6903 transitions. [2022-07-20 00:03:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:03:24,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 175 [2022-07-20 00:03:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:03:24,896 INFO L225 Difference]: With dead ends: 4652 [2022-07-20 00:03:24,897 INFO L226 Difference]: Without dead ends: 3059 [2022-07-20 00:03:24,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:03:24,903 INFO L413 NwaCegarLoop]: 1984 mSDtfsCounter, 1541 mSDsluCounter, 3129 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 714 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 5113 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 714 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-20 00:03:24,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 5113 Invalid, 3257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [714 Valid, 2542 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-07-20 00:03:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2022-07-20 00:03:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2159. [2022-07-20 00:03:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 1586 states have (on average 1.3833543505674653) internal successors, (2194), 1627 states have internal predecessors, (2194), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-20 00:03:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 3089 transitions. [2022-07-20 00:03:25,112 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 3089 transitions. Word has length 175 [2022-07-20 00:03:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:03:25,113 INFO L495 AbstractCegarLoop]: Abstraction has 2159 states and 3089 transitions. [2022-07-20 00:03:25,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 00:03:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 3089 transitions. [2022-07-20 00:03:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-20 00:03:25,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:03:25,123 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:03:25,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 00:03:25,123 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:03:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:03:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1482100280, now seen corresponding path program 1 times [2022-07-20 00:03:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:03:25,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801128625] [2022-07-20 00:03:25,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:03:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:03:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:03:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:03:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:03:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:03:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:03:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:03:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:03:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:03:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:03:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:03:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:03:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:03:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:03:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 00:03:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-20 00:03:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 00:03:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-20 00:03:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 00:03:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 00:03:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 00:03:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-20 00:03:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:03:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801128625] [2022-07-20 00:03:25,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801128625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:03:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440131795] [2022-07-20 00:03:25,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:03:25,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:03:25,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:03:25,530 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) [2022-07-20 00:03:25,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 00:03:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:26,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 00:03:26,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:03:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-20 00:03:26,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:03:26,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440131795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:03:26,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:03:26,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2022-07-20 00:03:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610643348] [2022-07-20 00:03:26,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:03:26,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:03:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:03:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:03:26,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-20 00:03:26,359 INFO L87 Difference]: Start difference. First operand 2159 states and 3089 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 00:03:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:03:26,918 INFO L93 Difference]: Finished difference Result 4849 states and 7125 transitions. [2022-07-20 00:03:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:03:26,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 183 [2022-07-20 00:03:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:03:26,928 INFO L225 Difference]: With dead ends: 4849 [2022-07-20 00:03:26,928 INFO L226 Difference]: Without dead ends: 3254 [2022-07-20 00:03:26,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-20 00:03:26,932 INFO L413 NwaCegarLoop]: 2279 mSDtfsCounter, 1174 mSDsluCounter, 8352 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 10631 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:03:26,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 10631 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 00:03:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2022-07-20 00:03:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 2164. [2022-07-20 00:03:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 1590 states have (on average 1.3823899371069182) internal successors, (2198), 1631 states have internal predecessors, (2198), 448 states have call successors, (448), 126 states have call predecessors, (448), 125 states have return successors, (451), 442 states have call predecessors, (451), 447 states have call successors, (451) [2022-07-20 00:03:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 3097 transitions. [2022-07-20 00:03:27,117 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 3097 transitions. Word has length 183 [2022-07-20 00:03:27,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:03:27,117 INFO L495 AbstractCegarLoop]: Abstraction has 2164 states and 3097 transitions. [2022-07-20 00:03:27,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 00:03:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 3097 transitions. [2022-07-20 00:03:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-20 00:03:27,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:03:27,128 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:03:27,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 00:03:27,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:03:27,344 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:03:27,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:03:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash 503652149, now seen corresponding path program 1 times [2022-07-20 00:03:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:03:27,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350010814] [2022-07-20 00:03:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:03:27,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:03:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:03:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:03:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:03:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:03:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:03:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:03:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:03:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:03:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:03:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:03:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:03:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:03:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:03:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:03:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:03:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:03:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 00:03:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-20 00:03:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 00:03:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 00:03:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 00:03:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-20 00:03:27,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:03:27,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350010814] [2022-07-20 00:03:27,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350010814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:03:27,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203057895] [2022-07-20 00:03:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:03:27,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:03:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:03:27,748 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) [2022-07-20 00:03:27,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 00:03:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:03:28,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-20 00:03:28,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:03:28,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 00:03:29,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 00:03:29,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-20 00:03:29,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 00:03:29,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2022-07-20 00:03:29,386 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 00:03:29,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 33 [2022-07-20 00:03:29,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 00:03:29,625 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-20 00:03:29,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-20 00:03:29,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-20 00:03:29,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-20 00:03:29,866 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-20 00:03:29,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-20 00:03:29,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-07-20 00:03:29,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-20 00:03:29,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:29,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-07-20 00:03:29,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 [2022-07-20 00:03:29,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-20 00:03:30,025 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-20 00:03:30,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 35 treesize of output 40 [2022-07-20 00:03:30,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-07-20 00:03:30,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:30,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 00:03:30,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:30,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-20 00:03:30,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-20 00:03:30,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 [2022-07-20 00:03:30,333 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-20 00:03:30,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 00:03:30,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:30,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 33 [2022-07-20 00:03:30,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:30,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2022-07-20 00:03:30,680 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-20 00:03:30,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 00:03:30,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:30,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 33 [2022-07-20 00:03:30,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:30,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2022-07-20 00:03:31,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:31,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:31,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2022-07-20 00:03:31,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:31,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 29 [2022-07-20 00:03:31,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:03:31,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 9 [2022-07-20 00:03:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 64 proven. 7 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-20 00:03:31,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:03:31,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_831) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_832) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_830) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (not (<= .cse0 2147483647)) (<= .cse0 0)))) is different from false [2022-07-20 00:03:31,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203057895] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:03:31,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:03:31,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 30] total 40 [2022-07-20 00:03:31,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140516277] [2022-07-20 00:03:31,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:03:31,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 00:03:31,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:03:31,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 00:03:31,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1441, Unknown=1, NotChecked=76, Total=1640 [2022-07-20 00:03:31,371 INFO L87 Difference]: Start difference. First operand 2164 states and 3097 transitions. Second operand has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-20 00:03:34,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:03:36,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:03:41,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:04:00,580 INFO L93 Difference]: Finished difference Result 5266 states and 7930 transitions. [2022-07-20 00:04:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-20 00:04:00,581 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) Word has length 189 [2022-07-20 00:04:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:04:00,597 INFO L225 Difference]: With dead ends: 5266 [2022-07-20 00:04:00,597 INFO L226 Difference]: Without dead ends: 3645 [2022-07-20 00:04:00,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 205 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=417, Invalid=4278, Unknown=1, NotChecked=134, Total=4830 [2022-07-20 00:04:00,606 INFO L413 NwaCegarLoop]: 2369 mSDtfsCounter, 5190 mSDsluCounter, 22009 mSDsCounter, 0 mSdLazyCounter, 24918 mSolverCounterSat, 2801 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5370 SdHoareTripleChecker+Valid, 24378 SdHoareTripleChecker+Invalid, 30172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2801 IncrementalHoareTripleChecker+Valid, 24918 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 2451 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:04:00,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5370 Valid, 24378 Invalid, 30172 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2801 Valid, 24918 Invalid, 2 Unknown, 2451 Unchecked, 27.7s Time] [2022-07-20 00:04:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2022-07-20 00:04:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 2180. [2022-07-20 00:04:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1601 states have (on average 1.3797626483447845) internal successors, (2209), 1644 states have internal predecessors, (2209), 448 states have call successors, (448), 126 states have call predecessors, (448), 130 states have return successors, (465), 445 states have call predecessors, (465), 447 states have call successors, (465) [2022-07-20 00:04:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3122 transitions. [2022-07-20 00:04:00,833 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3122 transitions. Word has length 189 [2022-07-20 00:04:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:04:00,834 INFO L495 AbstractCegarLoop]: Abstraction has 2180 states and 3122 transitions. [2022-07-20 00:04:00,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-20 00:04:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3122 transitions. [2022-07-20 00:04:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-20 00:04:00,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:04:00,844 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:04:00,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 00:04:01,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:04:01,060 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:04:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:04:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1115474398, now seen corresponding path program 1 times [2022-07-20 00:04:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:04:01,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863497944] [2022-07-20 00:04:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:04:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:04:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:04:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:04:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:04:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:04:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:04:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 00:04:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:04:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:04:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:04:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 00:04:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 00:04:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:04:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 00:04:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-20 00:04:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 00:04:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 00:04:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-20 00:04:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 00:04:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 00:04:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-20 00:04:02,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:04:02,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863497944] [2022-07-20 00:04:02,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863497944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:04:02,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270296669] [2022-07-20 00:04:02,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:04:02,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:04:02,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:04:02,904 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) [2022-07-20 00:04:02,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 00:04:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:04:03,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 187 conjunts are in the unsatisfiable core [2022-07-20 00:04:03,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:04:03,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 00:04:04,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 00:04:04,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 00:04:04,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:04,869 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-07-20 00:04:04,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 30 [2022-07-20 00:04:05,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 00:04:05,184 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 00:04:05,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 00:04:05,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 00:04:05,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 00:04:05,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:05,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:05,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:05,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-20 00:04:05,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 00:04:05,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:05,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 33 [2022-07-20 00:04:05,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:05,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2022-07-20 00:04:05,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:05,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 00:04:06,386 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-20 00:04:06,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-20 00:04:06,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-20 00:04:06,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-20 00:04:06,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2022-07-20 00:04:06,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-07-20 00:04:06,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:06,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-20 00:04:06,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 00:04:06,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 33 [2022-07-20 00:04:06,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-20 00:04:07,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:07,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 00:04:07,147 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 00:04:07,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-07-20 00:04:07,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-20 00:04:07,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 40 [2022-07-20 00:04:07,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:07,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-20 00:04:07,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 00:04:07,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:07,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:07,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:07,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-20 00:04:07,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:07,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2022-07-20 00:04:07,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:07,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 00:04:08,067 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 00:04:08,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-07-20 00:04:08,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:08,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2022-07-20 00:04:08,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:08,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:08,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:08,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-20 00:04:08,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:08,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 27 [2022-07-20 00:04:08,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:08,919 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 00:04:08,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 32 [2022-07-20 00:04:08,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:04:08,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 9 [2022-07-20 00:04:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 64 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-20 00:04:08,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:04:08,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1105) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1107) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1106) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (<= .cse0 0) (not (<= .cse0 2147483647))))) is different from false [2022-07-20 00:04:09,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270296669] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:04:09,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:04:09,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 68 [2022-07-20 00:04:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274126778] [2022-07-20 00:04:09,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:04:09,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-20 00:04:09,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:04:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-20 00:04:09,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4355, Unknown=1, NotChecked=132, Total=4692 [2022-07-20 00:04:09,015 INFO L87 Difference]: Start difference. First operand 2180 states and 3122 transitions. Second operand has 68 states, 66 states have (on average 3.515151515151515) internal successors, (232), 54 states have internal predecessors, (232), 22 states have call successors, (45), 13 states have call predecessors, (45), 17 states have return successors, (37), 25 states have call predecessors, (37), 21 states have call successors, (37) [2022-07-20 00:04:16,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:18,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:21,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:23,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:25,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:27,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:29,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:31,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:37,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:39,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:41,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:45,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:47,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:49,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:51,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:53,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:55,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:57,811 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:04:59,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:02,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:04,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:06,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:08,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:10,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:12,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:14,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:16,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:18,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:21,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:23,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:25,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:27,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:29,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:31,591 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:05:33,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []