./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 f4b24e32 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-?-f4b24e3 [2022-07-14 00:40:30,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:40:30,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:40:30,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:40:30,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:40:30,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:40:30,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:40:30,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:40:30,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:40:30,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:40:30,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:40:30,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:40:30,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:40:30,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:40:30,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:40:30,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:40:30,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:40:30,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:40:30,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:40:30,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:40:30,574 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:40:30,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:40:30,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:40:30,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:40:30,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:40:30,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:40:30,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:40:30,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:40:30,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:40:30,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:40:30,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:40:30,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:40:30,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:40:30,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:40:30,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:40:30,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:40:30,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:40:30,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:40:30,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:40:30,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:40:30,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:40:30,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:40:30,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:40:30,627 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:40:30,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:40:30,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:40:30,628 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:40:30,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:40:30,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:40:30,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:40:30,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:40:30,630 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:40:30,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:40:30,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:40:30,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:40:30,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:40:30,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:40:30,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:40:30,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:40:30,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:40:30,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:40:30,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:40:30,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:40:30,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:40:30,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:40:30,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:40:30,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:40:30,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:40:30,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:40:30,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:40:30,635 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:40:30,635 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:40:30,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:40:30,636 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-14 00:40:30,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:40:30,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:40:30,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:40:30,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:40:30,907 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:40:30,908 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-14 00:40:30,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8c16ae7/b68a8b2f94914b0d996ed2aa97633d22/FLAGebe310a02 [2022-07-14 00:40:31,633 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:40:31,634 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-14 00:40:31,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8c16ae7/b68a8b2f94914b0d996ed2aa97633d22/FLAGebe310a02 [2022-07-14 00:40:31,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8c16ae7/b68a8b2f94914b0d996ed2aa97633d22 [2022-07-14 00:40:31,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:40:31,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:40:31,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:40:31,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:40:31,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:40:31,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:40:31" (1/1) ... [2022-07-14 00:40:32,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42975c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:32, skipping insertion in model container [2022-07-14 00:40:32,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:40:31" (1/1) ... [2022-07-14 00:40:32,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:40:32,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:40:32,608 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-14 00:40:33,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:40:33,157 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:40:33,224 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-14 00:40:33,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:40:33,526 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:40:33,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33 WrapperNode [2022-07-14 00:40:33,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:40:33,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:40:33,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:40:33,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:40:33,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (1/1) ... [2022-07-14 00:40:33,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (1/1) ... [2022-07-14 00:40:33,692 INFO L137 Inliner]: procedures = 184, calls = 828, calls flagged for inlining = 92, calls inlined = 90, statements flattened = 3190 [2022-07-14 00:40:33,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:40:33,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:40:33,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:40:33,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:40:33,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (1/1) ... [2022-07-14 00:40:33,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (1/1) ... [2022-07-14 00:40:33,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (1/1) ... [2022-07-14 00:40:33,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (1/1) ... [2022-07-14 00:40:33,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (1/1) ... [2022-07-14 00:40:33,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (1/1) ... [2022-07-14 00:40:33,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (1/1) ... [2022-07-14 00:40:33,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:40:33,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:40:33,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:40:33,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:40:33,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (1/1) ... [2022-07-14 00:40:33,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:40:33,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:40:33,900 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-14 00:40:33,927 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-14 00:40:33,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-14 00:40:33,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-14 00:40:33,950 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-07-14 00:40:33,951 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-07-14 00:40:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 00:40:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-14 00:40:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-14 00:40:33,951 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-14 00:40:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 00:40:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 00:40:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:40:33,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:40:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:40:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-14 00:40:33,952 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-14 00:40:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-14 00:40:33,953 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-14 00:40:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-14 00:40:33,953 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-14 00:40:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 00:40:33,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 00:40:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-14 00:40:33,954 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-14 00:40:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:40:33,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:40:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-14 00:40:33,954 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-14 00:40:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-14 00:40:33,955 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-14 00:40:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:40:33,955 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:40:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-14 00:40:33,955 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-14 00:40:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:40:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:40:33,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:40:33,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 00:40:33,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 00:40:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-14 00:40:33,957 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-14 00:40:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:40:33,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:40:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-14 00:40:33,957 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-14 00:40:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-14 00:40:33,958 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-14 00:40:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:40:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-07-14 00:40:33,958 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-07-14 00:40:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-14 00:40:33,959 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-14 00:40:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-14 00:40:33,959 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-14 00:40:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:40:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-14 00:40:33,960 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-14 00:40:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-14 00:40:33,961 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-14 00:40:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:40:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:40:33,962 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-14 00:40:33,962 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-14 00:40:33,962 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-14 00:40:33,962 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-07-14 00:40:33,962 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-07-14 00:40:33,962 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-14 00:40:33,962 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-14 00:40:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-07-14 00:40:33,963 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-07-14 00:40:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:40:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-14 00:40:33,963 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-14 00:40:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-14 00:40:33,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-14 00:40:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-14 00:40:33,964 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-14 00:40:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-14 00:40:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-14 00:40:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-14 00:40:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-14 00:40:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:40:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-14 00:40:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-14 00:40:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:40:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-14 00:40:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-14 00:40:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-14 00:40:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-14 00:40:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-07-14 00:40:33,967 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-07-14 00:40:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-14 00:40:33,967 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-14 00:40:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-14 00:40:33,968 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-14 00:40:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-07-14 00:40:33,969 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-07-14 00:40:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-14 00:40:33,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-14 00:40:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 00:40:33,969 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 00:40:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-14 00:40:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-14 00:40:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-14 00:40:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-14 00:40:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-14 00:40:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-14 00:40:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:40:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-14 00:40:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-14 00:40:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-14 00:40:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-14 00:40:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-14 00:40:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-14 00:40:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 00:40:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 00:40:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 00:40:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:40:33,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:40:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-14 00:40:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-14 00:40:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-14 00:40:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-14 00:40:34,517 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:40:34,521 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:40:34,728 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:40:36,801 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:40:36,839 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:40:36,839 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 00:40:36,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:40:36 BoogieIcfgContainer [2022-07-14 00:40:36,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:40:36,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:40:36,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:40:36,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:40:36,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:40:31" (1/3) ... [2022-07-14 00:40:36,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21101d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:40:36, skipping insertion in model container [2022-07-14 00:40:36,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:40:33" (2/3) ... [2022-07-14 00:40:36,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21101d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:40:36, skipping insertion in model container [2022-07-14 00:40:36,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:40:36" (3/3) ... [2022-07-14 00:40:36,860 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-14 00:40:36,911 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:40:36,912 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:40:36,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:40:36,997 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@b886f24, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d97218f [2022-07-14 00:40:36,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:40:37,004 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-14 00:40:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-14 00:40:37,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:40:37,021 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-14 00:40:37,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:40:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:40:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash 385485251, now seen corresponding path program 1 times [2022-07-14 00:40:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:40:37,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148024065] [2022-07-14 00:40:37,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:40:37,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:40:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:40:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:37,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:40:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:37,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:40:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:40:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:40:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:37,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:40:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:40:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:37,527 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-14 00:40:37,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:40:37,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148024065] [2022-07-14 00:40:37,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148024065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:40:37,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:40:37,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:40:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276072096] [2022-07-14 00:40:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:40:37,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:40:37,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:40:37,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:40:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:40:37,564 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-14 00:40:39,965 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-14 00:40:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:40:42,273 INFO L93 Difference]: Finished difference Result 2928 states and 4383 transitions. [2022-07-14 00:40:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:40:42,275 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-14 00:40:42,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:40:42,306 INFO L225 Difference]: With dead ends: 2928 [2022-07-14 00:40:42,307 INFO L226 Difference]: Without dead ends: 1758 [2022-07-14 00:40:42,316 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-14 00:40:42,319 INFO L413 NwaCegarLoop]: 1697 mSDtfsCounter, 1444 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 501 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:40:42,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 3243 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 1335 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-07-14 00:40:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2022-07-14 00:40:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1599. [2022-07-14 00:40:42,501 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-14 00:40:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2318 transitions. [2022-07-14 00:40:42,515 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2318 transitions. Word has length 63 [2022-07-14 00:40:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:40:42,517 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2318 transitions. [2022-07-14 00:40:42,517 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-14 00:40:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2318 transitions. [2022-07-14 00:40:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-14 00:40:42,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:40:42,535 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-14 00:40:42,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:40:42,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:40:42,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:40:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1548414277, now seen corresponding path program 1 times [2022-07-14 00:40:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:40:42,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123056979] [2022-07-14 00:40:42,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:40:42,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:40:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:40:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:40:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:40:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:40:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:40:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:40:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:40:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:40:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:40:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 00:40:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 00:40:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:42,767 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-14 00:40:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:40:42,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123056979] [2022-07-14 00:40:42,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123056979] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:40:42,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:40:42,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:40:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602970174] [2022-07-14 00:40:42,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:40:42,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:40:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:40:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:40:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:40:42,771 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-14 00:40:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:40:44,931 INFO L93 Difference]: Finished difference Result 3364 states and 4935 transitions. [2022-07-14 00:40:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:40:44,932 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-14 00:40:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:40:44,941 INFO L225 Difference]: With dead ends: 3364 [2022-07-14 00:40:44,942 INFO L226 Difference]: Without dead ends: 1789 [2022-07-14 00:40:44,947 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-14 00:40:44,948 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 1824 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:40:44,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 2559 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-14 00:40:44,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-07-14 00:40:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1599. [2022-07-14 00:40:45,012 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-14 00:40:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2316 transitions. [2022-07-14 00:40:45,022 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2316 transitions. Word has length 104 [2022-07-14 00:40:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:40:45,022 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2316 transitions. [2022-07-14 00:40:45,022 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-14 00:40:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2316 transitions. [2022-07-14 00:40:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-14 00:40:45,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:40:45,029 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-14 00:40:45,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:40:45,030 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:40:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:40:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash -480171833, now seen corresponding path program 1 times [2022-07-14 00:40:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:40:45,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143165420] [2022-07-14 00:40:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:40:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:40:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:40:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:40:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:40:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:40:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:40:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:40:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:40:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:40:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:40:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 00:40:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 00:40:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:45,170 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-14 00:40:45,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:40:45,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143165420] [2022-07-14 00:40:45,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143165420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:40:45,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:40:45,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:40:45,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849265661] [2022-07-14 00:40:45,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:40:45,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:40:45,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:40:45,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:40:45,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:40:45,173 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-14 00:40:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:40:49,849 INFO L93 Difference]: Finished difference Result 3368 states and 4935 transitions. [2022-07-14 00:40:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:40:49,850 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-14 00:40:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:40:49,861 INFO L225 Difference]: With dead ends: 3368 [2022-07-14 00:40:49,861 INFO L226 Difference]: Without dead ends: 1789 [2022-07-14 00:40:49,866 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-14 00:40:49,867 INFO L413 NwaCegarLoop]: 1484 mSDtfsCounter, 558 mSDsluCounter, 2881 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 4365 SdHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:40:49,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 4365 Invalid, 2483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-14 00:40:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-07-14 00:40:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1599. [2022-07-14 00:40:49,925 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-14 00:40:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2314 transitions. [2022-07-14 00:40:49,933 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2314 transitions. Word has length 104 [2022-07-14 00:40:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:40:49,934 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2314 transitions. [2022-07-14 00:40:49,934 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-14 00:40:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2314 transitions. [2022-07-14 00:40:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-14 00:40:49,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:40:49,938 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-14 00:40:49,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:40:49,939 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:40:49,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:40:49,940 INFO L85 PathProgramCache]: Analyzing trace with hash -899814917, now seen corresponding path program 1 times [2022-07-14 00:40:49,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:40:49,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043584139] [2022-07-14 00:40:49,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:40:49,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:40:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:40:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:40:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:40:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:40:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:40:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:40:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:40:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:40:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:40:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:40:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:40:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:50,119 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-14 00:40:50,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:40:50,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043584139] [2022-07-14 00:40:50,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043584139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:40:50,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:40:50,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:40:50,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171205643] [2022-07-14 00:40:50,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:40:50,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:40:50,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:40:50,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:40:50,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:40:50,122 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-14 00:40:52,483 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-14 00:40:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:40:54,508 INFO L93 Difference]: Finished difference Result 2380 states and 3634 transitions. [2022-07-14 00:40:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:40:54,509 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-14 00:40:54,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:40:54,526 INFO L225 Difference]: With dead ends: 2380 [2022-07-14 00:40:54,526 INFO L226 Difference]: Without dead ends: 2377 [2022-07-14 00:40:54,528 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-14 00:40:54,531 INFO L413 NwaCegarLoop]: 2080 mSDtfsCounter, 1807 mSDsluCounter, 3118 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 730 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 5198 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 730 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:40:54,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1929 Valid, 5198 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [730 Valid, 2090 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-14 00:40:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-07-14 00:40:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1601. [2022-07-14 00:40:54,613 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-14 00:40:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2316 transitions. [2022-07-14 00:40:54,621 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2316 transitions. Word has length 107 [2022-07-14 00:40:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:40:54,622 INFO L495 AbstractCegarLoop]: Abstraction has 1601 states and 2316 transitions. [2022-07-14 00:40:54,623 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-14 00:40:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2316 transitions. [2022-07-14 00:40:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 00:40:54,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:40:54,629 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-14 00:40:54,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:40:54,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:40:54,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:40:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash 578773151, now seen corresponding path program 1 times [2022-07-14 00:40:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:40:54,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415652672] [2022-07-14 00:40:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:40:54,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:40:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:40:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:40:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:40:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:40:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:40:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:40:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:40:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:40:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:40:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:40:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:40:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:40:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:40:54,888 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-14 00:40:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:40:54,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415652672] [2022-07-14 00:40:54,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415652672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:40:54,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:40:54,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:40:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644403018] [2022-07-14 00:40:54,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:40:54,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:40:54,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:40:54,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:40:54,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:40:54,892 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-14 00:40:56,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:40:58,870 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-14 00:41:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:41:01,457 INFO L93 Difference]: Finished difference Result 3957 states and 5919 transitions. [2022-07-14 00:41:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:41:01,457 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-14 00:41:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:41:01,472 INFO L225 Difference]: With dead ends: 3957 [2022-07-14 00:41:01,472 INFO L226 Difference]: Without dead ends: 2380 [2022-07-14 00:41:01,479 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-14 00:41:01,480 INFO L413 NwaCegarLoop]: 1833 mSDtfsCounter, 2450 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 734 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2710 SdHoareTripleChecker+Valid, 4164 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:41:01,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2710 Valid, 4164 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 2129 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-14 00:41:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-07-14 00:41:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1602. [2022-07-14 00:41:01,581 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-14 00:41:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2317 transitions. [2022-07-14 00:41:01,587 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2317 transitions. Word has length 117 [2022-07-14 00:41:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:41:01,588 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2317 transitions. [2022-07-14 00:41:01,589 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-14 00:41:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2317 transitions. [2022-07-14 00:41:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-14 00:41:01,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:41:01,594 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-14 00:41:01,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:41:01,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:41:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:41:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1349496606, now seen corresponding path program 1 times [2022-07-14 00:41:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:41:01,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71143655] [2022-07-14 00:41:01,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:41:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:41:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:41:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:41:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:41:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:41:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:41:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:41:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:41:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:41:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:41:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:41:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:41:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:01,778 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-14 00:41:01,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:41:01,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71143655] [2022-07-14 00:41:01,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71143655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:41:01,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:41:01,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:41:01,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643112107] [2022-07-14 00:41:01,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:41:01,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:41:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:41:01,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:41:01,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:41:01,781 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-14 00:41:03,924 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-14 00:41:06,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:41:08,093 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-14 00:41:11,690 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-14 00:41:12,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:41:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:41:16,627 INFO L93 Difference]: Finished difference Result 3312 states and 5203 transitions. [2022-07-14 00:41:16,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:41:16,628 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-14 00:41:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:41:16,646 INFO L225 Difference]: With dead ends: 3312 [2022-07-14 00:41:16,647 INFO L226 Difference]: Without dead ends: 3309 [2022-07-14 00:41:16,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:41:16,650 INFO L413 NwaCegarLoop]: 2516 mSDtfsCounter, 2306 mSDsluCounter, 6392 mSDsCounter, 0 mSdLazyCounter, 3805 mSolverCounterSat, 811 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2523 SdHoareTripleChecker+Valid, 8908 SdHoareTripleChecker+Invalid, 4620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 811 IncrementalHoareTripleChecker+Valid, 3805 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:41:16,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2523 Valid, 8908 Invalid, 4620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [811 Valid, 3805 Invalid, 4 Unknown, 0 Unchecked, 14.5s Time] [2022-07-14 00:41:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2022-07-14 00:41:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1604. [2022-07-14 00:41:16,755 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-14 00:41:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2320 transitions. [2022-07-14 00:41:16,761 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2320 transitions. Word has length 119 [2022-07-14 00:41:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:41:16,761 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 2320 transitions. [2022-07-14 00:41:16,762 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-14 00:41:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2320 transitions. [2022-07-14 00:41:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-14 00:41:16,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:41:16,770 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-14 00:41:16,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:41:16,770 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:41:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:41:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1867335849, now seen corresponding path program 1 times [2022-07-14 00:41:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:41:16,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404602269] [2022-07-14 00:41:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:41:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:41:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:41:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:41:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:41:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:41:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:41:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:41:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:41:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:41:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:41:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:41:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:41:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:16,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:41:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:17,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 00:41:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 00:41:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:17,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 00:41:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:17,039 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-14 00:41:17,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:41:17,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404602269] [2022-07-14 00:41:17,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404602269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:41:17,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:41:17,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:41:17,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836930979] [2022-07-14 00:41:17,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:41:17,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:41:17,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:41:17,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:41:17,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:41:17,043 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-14 00:41:19,171 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-14 00:41:21,527 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-14 00:41:24,528 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-14 00:41:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:41:27,916 INFO L93 Difference]: Finished difference Result 3995 states and 5839 transitions. [2022-07-14 00:41:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:41:27,917 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-14 00:41:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:41:27,927 INFO L225 Difference]: With dead ends: 3995 [2022-07-14 00:41:27,928 INFO L226 Difference]: Without dead ends: 2415 [2022-07-14 00:41:27,932 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-14 00:41:27,933 INFO L413 NwaCegarLoop]: 2140 mSDtfsCounter, 2311 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 915 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2493 SdHoareTripleChecker+Valid, 3454 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:41:27,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2493 Valid, 3454 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 1141 Invalid, 3 Unknown, 0 Unchecked, 10.6s Time] [2022-07-14 00:41:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-07-14 00:41:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2141. [2022-07-14 00:41:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 1569 states have (on average 1.391332058636074) internal successors, (2183), 1610 states have internal predecessors, (2183), 448 states have call successors, (448), 125 states have call predecessors, (448), 123 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-14 00:41:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 3078 transitions. [2022-07-14 00:41:28,068 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 3078 transitions. Word has length 149 [2022-07-14 00:41:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:41:28,068 INFO L495 AbstractCegarLoop]: Abstraction has 2141 states and 3078 transitions. [2022-07-14 00:41:28,069 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-14 00:41:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 3078 transitions. [2022-07-14 00:41:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-14 00:41:28,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:41:28,080 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-14 00:41:28,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 00:41:28,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:41:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:41:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash 178046639, now seen corresponding path program 1 times [2022-07-14 00:41:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:41:28,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169115773] [2022-07-14 00:41:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:41:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:41:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:41:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:41:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:41:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:41:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:41:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:41:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:41:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:41:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:41:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:41:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:41:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 00:41:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:41:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 00:41:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 00:41:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:28,312 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-14 00:41:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:41:28,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169115773] [2022-07-14 00:41:28,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169115773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:41:28,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:41:28,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:41:28,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991264126] [2022-07-14 00:41:28,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:41:28,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:41:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:41:28,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:41:28,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:41:28,315 INFO L87 Difference]: Start difference. First operand 2141 states and 3078 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-14 00:41:31,513 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-14 00:41:33,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:41:33,951 INFO L93 Difference]: Finished difference Result 4583 states and 6824 transitions. [2022-07-14 00:41:33,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:41:33,952 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-14 00:41:33,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:41:33,964 INFO L225 Difference]: With dead ends: 4583 [2022-07-14 00:41:33,965 INFO L226 Difference]: Without dead ends: 3003 [2022-07-14 00:41:33,969 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-14 00:41:33,970 INFO L413 NwaCegarLoop]: 2016 mSDtfsCounter, 2282 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 2209 mSolverCounterSat, 666 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2537 SdHoareTripleChecker+Valid, 4622 SdHoareTripleChecker+Invalid, 2876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 2209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:41:33,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2537 Valid, 4622 Invalid, 2876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 2209 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-07-14 00:41:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2022-07-14 00:41:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2145. [2022-07-14 00:41:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1573 states have (on average 1.3909726636999364) internal successors, (2188), 1614 states have internal predecessors, (2188), 448 states have call successors, (448), 125 states have call predecessors, (448), 123 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-14 00:41:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3083 transitions. [2022-07-14 00:41:34,118 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3083 transitions. Word has length 151 [2022-07-14 00:41:34,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:41:34,119 INFO L495 AbstractCegarLoop]: Abstraction has 2145 states and 3083 transitions. [2022-07-14 00:41:34,119 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-14 00:41:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3083 transitions. [2022-07-14 00:41:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-14 00:41:34,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:41:34,131 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-14 00:41:34,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 00:41:34,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:41:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:41:34,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1182989250, now seen corresponding path program 1 times [2022-07-14 00:41:34,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:41:34,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203636935] [2022-07-14 00:41:34,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:34,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:41:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:41:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:41:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:41:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:41:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:41:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:41:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:41:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:41:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:41:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:41:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:41:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:41:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 00:41:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 00:41:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 00:41:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 00:41:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:34,316 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-14 00:41:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:41:34,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203636935] [2022-07-14 00:41:34,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203636935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:41:34,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:41:34,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:41:34,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874132041] [2022-07-14 00:41:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:41:34,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:41:34,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:41:34,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:41:34,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:41:34,320 INFO L87 Difference]: Start difference. First operand 2145 states and 3083 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-14 00:41:36,442 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-14 00:41:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:41:40,274 INFO L93 Difference]: Finished difference Result 4540 states and 6638 transitions. [2022-07-14 00:41:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:41:40,274 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-14 00:41:40,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:41:40,285 INFO L225 Difference]: With dead ends: 4540 [2022-07-14 00:41:40,285 INFO L226 Difference]: Without dead ends: 2419 [2022-07-14 00:41:40,293 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-14 00:41:40,294 INFO L413 NwaCegarLoop]: 1478 mSDtfsCounter, 1006 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 534 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 2976 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:41:40,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 2976 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 1205 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-07-14 00:41:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2022-07-14 00:41:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2145. [2022-07-14 00:41:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1573 states have (on average 1.3852511125238398) internal successors, (2179), 1614 states have internal predecessors, (2179), 448 states have call successors, (448), 125 states have call predecessors, (448), 123 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-14 00:41:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3074 transitions. [2022-07-14 00:41:40,431 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3074 transitions. Word has length 154 [2022-07-14 00:41:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:41:40,431 INFO L495 AbstractCegarLoop]: Abstraction has 2145 states and 3074 transitions. [2022-07-14 00:41:40,432 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-14 00:41:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3074 transitions. [2022-07-14 00:41:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-14 00:41:40,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:41:40,445 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-14 00:41:40,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:41:40,446 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:41:40,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:41:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1835092685, now seen corresponding path program 1 times [2022-07-14 00:41:40,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:41:40,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758379015] [2022-07-14 00:41:40,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:40,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:41:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:41:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:41:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:41:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:41:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:41:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:41:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:41:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:41:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:41:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:41:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:41:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:41:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 00:41:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 00:41:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 00:41:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 00:41:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:40,723 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-14 00:41:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:41:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758379015] [2022-07-14 00:41:40,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758379015] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:41:40,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916621515] [2022-07-14 00:41:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:40,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:41:40,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:41:40,731 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-14 00:41:40,756 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-14 00:41:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:41,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:41:41,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:41:41,471 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-14 00:41:41,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:41:41,703 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-14 00:41:41,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916621515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:41:41,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:41:41,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2022-07-14 00:41:41,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513643845] [2022-07-14 00:41:41,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:41:41,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 00:41:41,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:41:41,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 00:41:41,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:41:41,706 INFO L87 Difference]: Start difference. First operand 2145 states and 3074 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-14 00:41:43,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:41:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:41:49,668 INFO L93 Difference]: Finished difference Result 6337 states and 9747 transitions. [2022-07-14 00:41:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:41:49,668 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-14 00:41:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:41:49,691 INFO L225 Difference]: With dead ends: 6337 [2022-07-14 00:41:49,691 INFO L226 Difference]: Without dead ends: 4753 [2022-07-14 00:41:49,698 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-14 00:41:49,699 INFO L413 NwaCegarLoop]: 2512 mSDtfsCounter, 6183 mSDsluCounter, 5573 mSDsCounter, 0 mSdLazyCounter, 4899 mSolverCounterSat, 2541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6558 SdHoareTripleChecker+Valid, 8085 SdHoareTripleChecker+Invalid, 7440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2541 IncrementalHoareTripleChecker+Valid, 4899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:41:49,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6558 Valid, 8085 Invalid, 7440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2541 Valid, 4899 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-07-14 00:41:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2022-07-14 00:41:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2152. [2022-07-14 00:41:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 1580 states have (on average 1.3848101265822785) internal successors, (2188), 1621 states have internal predecessors, (2188), 448 states have call successors, (448), 125 states have call predecessors, (448), 123 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-14 00:41:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 3083 transitions. [2022-07-14 00:41:49,918 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 3083 transitions. Word has length 157 [2022-07-14 00:41:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:41:49,918 INFO L495 AbstractCegarLoop]: Abstraction has 2152 states and 3083 transitions. [2022-07-14 00:41:49,919 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-14 00:41:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 3083 transitions. [2022-07-14 00:41:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-14 00:41:49,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:41:49,930 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-14 00:41:49,981 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-14 00:41:50,143 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-14 00:41:50,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:41:50,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:41:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1991118289, now seen corresponding path program 1 times [2022-07-14 00:41:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:41:50,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620298469] [2022-07-14 00:41:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:41:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:41:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:41:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:41:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:41:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:41:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:41:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:41:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:41:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:41:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:41:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:41:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:41:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:41:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 00:41:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:41:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 00:41:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 00:41:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,496 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-14 00:41:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:41:50,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620298469] [2022-07-14 00:41:50,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620298469] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:41:50,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744770360] [2022-07-14 00:41:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:50,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:41:50,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:41:50,498 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-14 00:41:50,500 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-14 00:41:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:50,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 00:41:50,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:41:51,056 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-14 00:41:51,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:41:51,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744770360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:41:51,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:41:51,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2022-07-14 00:41:51,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367409392] [2022-07-14 00:41:51,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:41:51,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:41:51,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:41:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:41:51,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:41:51,061 INFO L87 Difference]: Start difference. First operand 2152 states and 3083 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-14 00:41:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:41:51,544 INFO L93 Difference]: Finished difference Result 4673 states and 6862 transitions. [2022-07-14 00:41:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:41:51,544 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-14 00:41:51,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:41:51,572 INFO L225 Difference]: With dead ends: 4673 [2022-07-14 00:41:51,572 INFO L226 Difference]: Without dead ends: 3082 [2022-07-14 00:41:51,579 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-14 00:41:51,580 INFO L413 NwaCegarLoop]: 2165 mSDtfsCounter, 933 mSDsluCounter, 3628 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 5793 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-14 00:41:51,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 5793 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:41:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2022-07-14 00:41:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2154. [2022-07-14 00:41:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 1582 states have (on average 1.384323640960809) internal successors, (2190), 1623 states have internal predecessors, (2190), 448 states have call successors, (448), 125 states have call predecessors, (448), 123 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-14 00:41:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 3085 transitions. [2022-07-14 00:41:51,790 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 3085 transitions. Word has length 166 [2022-07-14 00:41:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:41:51,791 INFO L495 AbstractCegarLoop]: Abstraction has 2154 states and 3085 transitions. [2022-07-14 00:41:51,791 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-14 00:41:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3085 transitions. [2022-07-14 00:41:51,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-14 00:41:51,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:41:51,800 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-14 00:41:51,828 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-14 00:41:52,027 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-14 00:41:52,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:41:52,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:41:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash -530211425, now seen corresponding path program 1 times [2022-07-14 00:41:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:41:52,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743337715] [2022-07-14 00:41:52,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:52,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:41:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:41:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:41:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:41:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:41:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:41:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:41:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:41:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:41:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:41:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:41:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:41:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:41:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:41:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:41:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 00:41:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:41:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 00:41:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 00:41:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 00:41:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:52,233 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-14 00:41:52,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:41:52,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743337715] [2022-07-14 00:41:52,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743337715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:41:52,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:41:52,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:41:52,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567829086] [2022-07-14 00:41:52,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:41:52,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:41:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:41:52,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:41:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:41:52,236 INFO L87 Difference]: Start difference. First operand 2154 states and 3085 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-14 00:41:54,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:41:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:41:58,178 INFO L93 Difference]: Finished difference Result 4649 states and 6901 transitions. [2022-07-14 00:41:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:41:58,178 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-14 00:41:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:41:58,190 INFO L225 Difference]: With dead ends: 4649 [2022-07-14 00:41:58,191 INFO L226 Difference]: Without dead ends: 3056 [2022-07-14 00:41:58,196 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-14 00:41:58,196 INFO L413 NwaCegarLoop]: 1984 mSDtfsCounter, 2001 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 990 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 4383 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:41:58,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 4383 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-14 00:41:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2022-07-14 00:41:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2156. [2022-07-14 00:41:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 1584 states have (on average 1.3838383838383839) internal successors, (2192), 1625 states have internal predecessors, (2192), 448 states have call successors, (448), 125 states have call predecessors, (448), 123 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-14 00:41:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3087 transitions. [2022-07-14 00:41:58,369 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3087 transitions. Word has length 175 [2022-07-14 00:41:58,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:41:58,371 INFO L495 AbstractCegarLoop]: Abstraction has 2156 states and 3087 transitions. [2022-07-14 00:41:58,371 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-14 00:41:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3087 transitions. [2022-07-14 00:41:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-14 00:41:58,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:41:58,380 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-14 00:41:58,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 00:41:58,381 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:41:58,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:41:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1482100280, now seen corresponding path program 1 times [2022-07-14 00:41:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:41:58,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486045692] [2022-07-14 00:41:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:41:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:41:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:41:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:41:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:41:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:41:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:41:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:41:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:41:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:41:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:41:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:41:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:41:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:41:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 00:41:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:41:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 00:41:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:41:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 00:41:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 00:41:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 00:41:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:58,761 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-14 00:41:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:41:58,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486045692] [2022-07-14 00:41:58,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486045692] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:41:58,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913772434] [2022-07-14 00:41:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:41:58,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:41:58,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:41:58,764 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-14 00:41:58,765 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-14 00:41:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:41:59,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 00:41:59,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:41:59,567 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-14 00:41:59,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:41:59,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913772434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:41:59,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:41:59,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2022-07-14 00:41:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84560008] [2022-07-14 00:41:59,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:41:59,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:41:59,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:41:59,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:41:59,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:41:59,570 INFO L87 Difference]: Start difference. First operand 2156 states and 3087 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-14 00:42:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:42:00,120 INFO L93 Difference]: Finished difference Result 4846 states and 7123 transitions. [2022-07-14 00:42:00,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:42:00,121 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-14 00:42:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:42:00,130 INFO L225 Difference]: With dead ends: 4846 [2022-07-14 00:42:00,131 INFO L226 Difference]: Without dead ends: 3251 [2022-07-14 00:42:00,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-14 00:42:00,136 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-14 00:42:00,136 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-14 00:42:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2022-07-14 00:42:00,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 2161. [2022-07-14 00:42:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 1588 states have (on average 1.3828715365239295) internal successors, (2196), 1629 states have internal predecessors, (2196), 448 states have call successors, (448), 125 states have call predecessors, (448), 124 states have return successors, (451), 442 states have call predecessors, (451), 447 states have call successors, (451) [2022-07-14 00:42:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 3095 transitions. [2022-07-14 00:42:00,312 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 3095 transitions. Word has length 183 [2022-07-14 00:42:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:42:00,316 INFO L495 AbstractCegarLoop]: Abstraction has 2161 states and 3095 transitions. [2022-07-14 00:42:00,316 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-14 00:42:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 3095 transitions. [2022-07-14 00:42:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-14 00:42:00,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:42:00,326 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-14 00:42:00,357 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-14 00:42:00,551 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-14 00:42:00,552 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:42:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:42:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash 503652149, now seen corresponding path program 1 times [2022-07-14 00:42:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:42:00,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294765890] [2022-07-14 00:42:00,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:42:00,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:42:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:42:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:42:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:42:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:42:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:42:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:42:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:42:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:42:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:42:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:42:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:42:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:42:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:42:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:42:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:42:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 00:42:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 00:42:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:42:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-14 00:42:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 00:42:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 00:42:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:00,944 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-14 00:42:00,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:42:00,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294765890] [2022-07-14 00:42:00,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294765890] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:42:00,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757001005] [2022-07-14 00:42:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:42:00,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:42:00,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:42:00,946 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-14 00:42:00,948 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-14 00:42:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:42:01,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-14 00:42:01,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:42:02,147 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-14 00:42:02,442 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-14 00:42:02,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,462 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-14 00:42:02,468 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-14 00:42:02,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,560 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-14 00:42:02,575 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 00:42:02,576 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-14 00:42:02,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,590 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-14 00:42:02,821 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-14 00:42:02,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, 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-14 00:42:02,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,833 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-14 00:42:02,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:02,841 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-14 00:42:03,037 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-14 00:42:03,037 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-14 00:42:03,041 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-14 00:42:03,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,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, 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-14 00:42:03,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,064 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-14 00:42:03,069 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-14 00:42:03,074 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-14 00:42:03,194 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-14 00:42:03,194 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-14 00:42:03,199 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-14 00:42:03,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,214 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-14 00:42:03,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,221 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-14 00:42:03,232 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-14 00:42:03,237 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-14 00:42:03,491 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-14 00:42:03,491 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-14 00:42:03,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,501 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-14 00:42:03,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,509 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-14 00:42:03,820 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-14 00:42:03,821 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-14 00:42:03,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,832 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-14 00:42:03,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:03,837 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-14 00:42:04,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:04,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:04,372 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-14 00:42:04,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:04,383 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-14 00:42:04,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:42:04,388 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-14 00:42:04,461 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-14 00:42:04,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:42:04,504 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-14 00:42:04,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757001005] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:42:04,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:42:04,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 30] total 40 [2022-07-14 00:42:04,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045283364] [2022-07-14 00:42:04,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:42:04,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-14 00:42:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:42:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 00:42:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1441, Unknown=1, NotChecked=76, Total=1640 [2022-07-14 00:42:04,524 INFO L87 Difference]: Start difference. First operand 2161 states and 3095 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-14 00:42:07,594 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-14 00:42:09,710 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-14 00:42:11,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:42:13,956 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-14 00:42:16,066 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-14 00:42:18,185 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-14 00:42:20,296 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-14 00:42:22,397 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-14 00:42:24,511 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-14 00:42:26,631 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-14 00:42:28,754 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-14 00:42:30,867 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-14 00:42:34,887 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-14 00:42:39,053 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-14 00:42:40,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:42:44,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:42:46,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:42:49,102 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-14 00:42:50,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:42:54,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:43:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:43:08,949 INFO L93 Difference]: Finished difference Result 5266 states and 7930 transitions. [2022-07-14 00:43:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 00:43:08,950 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-14 00:43:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:43:08,961 INFO L225 Difference]: With dead ends: 5266 [2022-07-14 00:43:08,961 INFO L226 Difference]: Without dead ends: 3645 [2022-07-14 00:43:08,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 205 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=417, Invalid=4278, Unknown=1, NotChecked=134, Total=4830 [2022-07-14 00:43:08,965 INFO L413 NwaCegarLoop]: 2370 mSDtfsCounter, 4590 mSDsluCounter, 30482 mSDsCounter, 0 mSdLazyCounter, 31353 mSolverCounterSat, 2516 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4770 SdHoareTripleChecker+Valid, 32852 SdHoareTripleChecker+Invalid, 38956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2516 IncrementalHoareTripleChecker+Valid, 31353 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 5071 IncrementalHoareTripleChecker+Unchecked, 62.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:43:08,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4770 Valid, 32852 Invalid, 38956 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2516 Valid, 31353 Invalid, 16 Unknown, 5071 Unchecked, 62.8s Time] [2022-07-14 00:43:08,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2022-07-14 00:43:09,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 2180. [2022-07-14 00:43:09,161 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-14 00:43:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3122 transitions. [2022-07-14 00:43:09,167 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3122 transitions. Word has length 189 [2022-07-14 00:43:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:43:09,167 INFO L495 AbstractCegarLoop]: Abstraction has 2180 states and 3122 transitions. [2022-07-14 00:43:09,168 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-14 00:43:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3122 transitions. [2022-07-14 00:43:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-14 00:43:09,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:43:09,176 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-14 00:43:09,200 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-14 00:43:09,384 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-14 00:43:09,384 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:43:09,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:43:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1115474398, now seen corresponding path program 1 times [2022-07-14 00:43:09,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:43:09,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345831787] [2022-07-14 00:43:09,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:09,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:43:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:43:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:43:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:43:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:43:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:43:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:43:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:43:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:43:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 00:43:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:43:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:43:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:10,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 00:43:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:43:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:11,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 00:43:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:11,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:43:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:11,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 00:43:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:11,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-14 00:43:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 00:43:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 00:43:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:11,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 00:43:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:11,145 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-14 00:43:11,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:43:11,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345831787] [2022-07-14 00:43:11,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345831787] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:11,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016878504] [2022-07-14 00:43:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:43:11,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:43:11,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:43:11,148 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-14 00:43:11,179 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-14 00:43:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:43:11,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 187 conjunts are in the unsatisfiable core [2022-07-14 00:43:11,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:43:11,855 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-14 00:43:12,429 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-14 00:43:12,677 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-14 00:43:13,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:13,048 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-07-14 00:43:13,049 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-14 00:43:13,209 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-14 00:43:13,319 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 00:43:13,319 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-14 00:43:13,517 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-14 00:43:13,953 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-14 00:43:13,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:13,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:13,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:13,967 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-14 00:43:13,974 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-14 00:43:14,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,091 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-14 00:43:14,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,098 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-14 00:43:14,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,111 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-14 00:43:14,422 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-14 00:43:14,422 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-14 00:43:14,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,440 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-14 00:43:14,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,448 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-14 00:43:14,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,756 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-14 00:43:14,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,766 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-14 00:43:14,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,810 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-14 00:43:14,817 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-14 00:43:14,823 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-14 00:43:14,828 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-14 00:43:14,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:14,997 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-14 00:43:15,010 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 00:43:15,011 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-14 00:43:15,017 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-14 00:43:15,020 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-14 00:43:15,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:15,033 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-14 00:43:15,038 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-14 00:43:15,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:15,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:15,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:15,407 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-14 00:43:15,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:15,413 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-14 00:43:15,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:15,428 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-14 00:43:15,746 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 00:43:15,746 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-14 00:43:15,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:15,753 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-14 00:43:15,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:15,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:15,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:15,768 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-14 00:43:16,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:16,350 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-14 00:43:16,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:16,358 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 00:43:16,358 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-14 00:43:16,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:43:16,363 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-14 00:43:16,369 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-14 00:43:16,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:43:16,401 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-14 00:43:16,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016878504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:43:16,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:43:16,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 68 [2022-07-14 00:43:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440548777] [2022-07-14 00:43:16,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:43:16,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-14 00:43:16,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:43:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-14 00:43:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4355, Unknown=1, NotChecked=132, Total=4692 [2022-07-14 00:43:16,417 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-14 00:43:20,029 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-14 00:43:22,142 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-14 00:43:24,251 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-14 00:43:26,348 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-14 00:43:28,458 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-14 00:43:30,568 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-14 00:43:32,680 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-14 00:43:34,789 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-14 00:43:36,899 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-14 00:43:39,022 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-14 00:43:41,131 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-14 00:43:43,240 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-14 00:43:45,355 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-14 00:43:47,465 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-14 00:43:49,574 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-14 00:43:51,682 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-14 00:43:53,794 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-14 00:43:55,908 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-14 00:43:58,009 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-14 00:44:00,111 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-14 00:44:02,217 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-14 00:44:04,319 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-14 00:44:06,418 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-14 00:44:08,525 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-14 00:44:10,627 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-14 00:44:12,740 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-14 00:44:14,851 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-14 00:44:16,960 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-14 00:44:19,079 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-14 00:44:21,198 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-14 00:44:23,339 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-14 00:44:25,447 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-14 00:44:27,558 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 []