./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.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 20e4a1f568783894f17840aa5f338f3fb65a6686c2b0eb1bb7dec08049ab8d00 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 12:07:39,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 12:07:39,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 12:07:39,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 12:07:39,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 12:07:39,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 12:07:39,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 12:07:39,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 12:07:39,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 12:07:39,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 12:07:39,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 12:07:39,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 12:07:39,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 12:07:39,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 12:07:39,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 12:07:39,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 12:07:39,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 12:07:39,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 12:07:39,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 12:07:39,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 12:07:39,857 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 12:07:39,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 12:07:39,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 12:07:39,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 12:07:39,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 12:07:39,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 12:07:39,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 12:07:39,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 12:07:39,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 12:07:39,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 12:07:39,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 12:07:39,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 12:07:39,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 12:07:39,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 12:07:39,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 12:07:39,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 12:07:39,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 12:07:39,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 12:07:39,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 12:07:39,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 12:07:39,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 12:07:39,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 12:07:39,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 12:07:39,897 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 12:07:39,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 12:07:39,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 12:07:39,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 12:07:39,899 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 12:07:39,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 12:07:39,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 12:07:39,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 12:07:39,900 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 12:07:39,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 12:07:39,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 12:07:39,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 12:07:39,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 12:07:39,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 12:07:39,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 12:07:39,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 12:07:39,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 12:07:39,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 12:07:39,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 12:07:39,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 12:07:39,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 12:07:39,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 12:07:39,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 12:07:39,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 12:07:39,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 12:07:39,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 12:07:39,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 12:07:39,911 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 12:07:39,911 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 12:07:39,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 12:07:39,912 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 -> 20e4a1f568783894f17840aa5f338f3fb65a6686c2b0eb1bb7dec08049ab8d00 [2022-07-21 12:07:40,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 12:07:40,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 12:07:40,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 12:07:40,221 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 12:07:40,222 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 12:07:40,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2022-07-21 12:07:40,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e16915b/982cd8cc448445b1a5ddfb086bb07fca/FLAG1ad7dbf35 [2022-07-21 12:07:40,828 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 12:07:40,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2022-07-21 12:07:40,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e16915b/982cd8cc448445b1a5ddfb086bb07fca/FLAG1ad7dbf35 [2022-07-21 12:07:41,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e16915b/982cd8cc448445b1a5ddfb086bb07fca [2022-07-21 12:07:41,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 12:07:41,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 12:07:41,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 12:07:41,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 12:07:41,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 12:07:41,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:07:41" (1/1) ... [2022-07-21 12:07:41,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4117e677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:41, skipping insertion in model container [2022-07-21 12:07:41,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:07:41" (1/1) ... [2022-07-21 12:07:41,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 12:07:41,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 12:07:41,997 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i[175998,176011] [2022-07-21 12:07:42,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 12:07:42,131 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 12:07:42,321 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i[175998,176011] [2022-07-21 12:07:42,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 12:07:42,451 INFO L208 MainTranslator]: Completed translation [2022-07-21 12:07:42,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42 WrapperNode [2022-07-21 12:07:42,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 12:07:42,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 12:07:42,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 12:07:42,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 12:07:42,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (1/1) ... [2022-07-21 12:07:42,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (1/1) ... [2022-07-21 12:07:42,662 INFO L137 Inliner]: procedures = 199, calls = 2183, calls flagged for inlining = 73, calls inlined = 51, statements flattened = 3134 [2022-07-21 12:07:42,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 12:07:42,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 12:07:42,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 12:07:42,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 12:07:42,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (1/1) ... [2022-07-21 12:07:42,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (1/1) ... [2022-07-21 12:07:42,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (1/1) ... [2022-07-21 12:07:42,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (1/1) ... [2022-07-21 12:07:42,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (1/1) ... [2022-07-21 12:07:42,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (1/1) ... [2022-07-21 12:07:42,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (1/1) ... [2022-07-21 12:07:42,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 12:07:42,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 12:07:42,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 12:07:42,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 12:07:42,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (1/1) ... [2022-07-21 12:07:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 12:07:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 12:07:42,843 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-21 12:07:42,861 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-21 12:07:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-21 12:07:42,873 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-21 12:07:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2022-07-21 12:07:42,874 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2022-07-21 12:07:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-21 12:07:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 12:07:42,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 12:07:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 12:07:42,874 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 12:07:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-21 12:07:42,874 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-21 12:07:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 12:07:42,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 12:07:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2022-07-21 12:07:42,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2022-07-21 12:07:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-21 12:07:42,875 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-21 12:07:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 12:07:42,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 12:07:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2022-07-21 12:07:42,876 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2022-07-21 12:07:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 12:07:42,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 12:07:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_resume [2022-07-21 12:07:42,876 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_resume [2022-07-21 12:07:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-21 12:07:42,876 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-21 12:07:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 12:07:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 12:07:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 12:07:42,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 12:07:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 12:07:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 12:07:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2022-07-21 12:07:42,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2022-07-21 12:07:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-21 12:07:42,877 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-21 12:07:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_send_address [2022-07-21 12:07:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_send_address [2022-07-21 12:07:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-21 12:07:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-21 12:07:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 12:07:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_wait [2022-07-21 12:07:42,879 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_wait [2022-07-21 12:07:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_remove [2022-07-21 12:07:42,879 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_remove [2022-07-21 12:07:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 12:07:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 12:07:42,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 12:07:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-21 12:07:42,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-21 12:07:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 12:07:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2022-07-21 12:07:42,880 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2022-07-21 12:07:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 12:07:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_write [2022-07-21 12:07:42,881 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_write [2022-07-21 12:07:42,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 12:07:42,881 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_ready [2022-07-21 12:07:42,882 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_ready [2022-07-21 12:07:42,882 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 12:07:42,882 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_suspend [2022-07-21 12:07:42,882 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_suspend [2022-07-21 12:07:42,883 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_read [2022-07-21 12:07:42,883 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_read [2022-07-21 12:07:42,883 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_probe [2022-07-21 12:07:42,883 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_probe [2022-07-21 12:07:42,883 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-21 12:07:42,883 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-21 12:07:42,883 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2022-07-21 12:07:42,883 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2022-07-21 12:07:42,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 12:07:42,884 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-21 12:07:42,884 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-21 12:07:42,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 12:07:42,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 12:07:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-21 12:07:42,885 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-21 12:07:43,314 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 12:07:43,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 12:07:50,717 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 12:07:51,454 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 12:07:51,462 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 12:07:51,462 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 12:07:51,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:07:51 BoogieIcfgContainer [2022-07-21 12:07:51,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 12:07:51,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 12:07:51,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 12:07:51,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 12:07:51,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 12:07:41" (1/3) ... [2022-07-21 12:07:51,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f045a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:07:51, skipping insertion in model container [2022-07-21 12:07:51,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:42" (2/3) ... [2022-07-21 12:07:51,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f045a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:07:51, skipping insertion in model container [2022-07-21 12:07:51,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:07:51" (3/3) ... [2022-07-21 12:07:51,470 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2022-07-21 12:07:51,479 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 12:07:51,480 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 12:07:51,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 12:07:51,523 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@2b47b46b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2953b6a1 [2022-07-21 12:07:51,523 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 12:07:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 751 states, 578 states have (on average 1.4792387543252594) internal successors, (855), 592 states have internal predecessors, (855), 140 states have call successors, (140), 32 states have call predecessors, (140), 31 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2022-07-21 12:07:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 12:07:51,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:07:51,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 12:07:51,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:07:51,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:07:51,540 INFO L85 PathProgramCache]: Analyzing trace with hash 392482652, now seen corresponding path program 1 times [2022-07-21 12:07:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:07:51,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448271404] [2022-07-21 12:07:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:07:51,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:07:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:51,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:07:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 12:07:51,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:07:51,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448271404] [2022-07-21 12:07:51,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448271404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:07:51,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:07:51,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 12:07:51,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331180034] [2022-07-21 12:07:51,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:07:51,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 12:07:51,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:07:51,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 12:07:51,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 12:07:51,955 INFO L87 Difference]: Start difference. First operand has 751 states, 578 states have (on average 1.4792387543252594) internal successors, (855), 592 states have internal predecessors, (855), 140 states have call successors, (140), 32 states have call predecessors, (140), 31 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 12:07:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:07:52,233 INFO L93 Difference]: Finished difference Result 2181 states and 3329 transitions. [2022-07-21 12:07:52,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 12:07:52,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-21 12:07:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:07:52,255 INFO L225 Difference]: With dead ends: 2181 [2022-07-21 12:07:52,255 INFO L226 Difference]: Without dead ends: 1419 [2022-07-21 12:07:52,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 12:07:52,265 INFO L413 NwaCegarLoop]: 1253 mSDtfsCounter, 1087 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 12:07:52,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 2303 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 12:07:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-07-21 12:07:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1415. [2022-07-21 12:07:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1096 states have (on average 1.4753649635036497) internal successors, (1617), 1108 states have internal predecessors, (1617), 258 states have call successors, (258), 61 states have call predecessors, (258), 60 states have return successors, (253), 253 states have call predecessors, (253), 253 states have call successors, (253) [2022-07-21 12:07:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2128 transitions. [2022-07-21 12:07:52,376 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2128 transitions. Word has length 21 [2022-07-21 12:07:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:07:52,376 INFO L495 AbstractCegarLoop]: Abstraction has 1415 states and 2128 transitions. [2022-07-21 12:07:52,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 12:07:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2128 transitions. [2022-07-21 12:07:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 12:07:52,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:07:52,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 12:07:52,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 12:07:52,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:07:52,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:07:52,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1015935201, now seen corresponding path program 1 times [2022-07-21 12:07:52,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:07:52,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679913997] [2022-07-21 12:07:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:07:52,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:07:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:52,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 12:07:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 12:07:52,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:07:52,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679913997] [2022-07-21 12:07:52,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679913997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:07:52,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:07:52,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 12:07:52,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243062935] [2022-07-21 12:07:52,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:07:52,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 12:07:52,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:07:52,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 12:07:52,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 12:07:52,583 INFO L87 Difference]: Start difference. First operand 1415 states and 2128 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 12:07:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:07:52,791 INFO L93 Difference]: Finished difference Result 3978 states and 5978 transitions. [2022-07-21 12:07:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 12:07:52,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-21 12:07:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:07:52,803 INFO L225 Difference]: With dead ends: 3978 [2022-07-21 12:07:52,804 INFO L226 Difference]: Without dead ends: 2566 [2022-07-21 12:07:52,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 12:07:52,810 INFO L413 NwaCegarLoop]: 1244 mSDtfsCounter, 904 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 12:07:52,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 2288 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 12:07:52,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-07-21 12:07:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2549. [2022-07-21 12:07:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 1962 states have (on average 1.4658511722731906) internal successors, (2876), 1982 states have internal predecessors, (2876), 481 states have call successors, (481), 106 states have call predecessors, (481), 105 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2022-07-21 12:07:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3833 transitions. [2022-07-21 12:07:52,889 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3833 transitions. Word has length 24 [2022-07-21 12:07:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:07:52,889 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 3833 transitions. [2022-07-21 12:07:52,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 12:07:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3833 transitions. [2022-07-21 12:07:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 12:07:52,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:07:52,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 12:07:52,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 12:07:52,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:07:52,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:07:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2094049435, now seen corresponding path program 1 times [2022-07-21 12:07:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:07:52,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843208560] [2022-07-21 12:07:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:07:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:07:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:53,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:07:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 12:07:53,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:07:53,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843208560] [2022-07-21 12:07:53,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843208560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:07:53,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:07:53,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 12:07:53,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572714838] [2022-07-21 12:07:53,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:07:53,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 12:07:53,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:07:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 12:07:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 12:07:53,075 INFO L87 Difference]: Start difference. First operand 2549 states and 3833 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 12:07:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:07:54,397 INFO L93 Difference]: Finished difference Result 2559 states and 3854 transitions. [2022-07-21 12:07:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 12:07:54,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-21 12:07:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:07:54,410 INFO L225 Difference]: With dead ends: 2559 [2022-07-21 12:07:54,410 INFO L226 Difference]: Without dead ends: 2556 [2022-07-21 12:07:54,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 12:07:54,413 INFO L413 NwaCegarLoop]: 1086 mSDtfsCounter, 1064 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 12:07:54,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1803 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-21 12:07:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-21 12:07:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2548. [2022-07-21 12:07:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 1962 states have (on average 1.4653414882772682) internal successors, (2875), 1981 states have internal predecessors, (2875), 480 states have call successors, (480), 106 states have call predecessors, (480), 105 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2022-07-21 12:07:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3831 transitions. [2022-07-21 12:07:54,491 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3831 transitions. Word has length 25 [2022-07-21 12:07:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:07:54,491 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 3831 transitions. [2022-07-21 12:07:54,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 12:07:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3831 transitions. [2022-07-21 12:07:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 12:07:54,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:07:54,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 12:07:54,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 12:07:54,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:07:54,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:07:54,494 INFO L85 PathProgramCache]: Analyzing trace with hash -491175993, now seen corresponding path program 1 times [2022-07-21 12:07:54,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:07:54,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896278620] [2022-07-21 12:07:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:07:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:07:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:54,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:07:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 12:07:54,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:07:54,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896278620] [2022-07-21 12:07:54,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896278620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:07:54,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:07:54,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 12:07:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789641425] [2022-07-21 12:07:54,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:07:54,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 12:07:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:07:54,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 12:07:54,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 12:07:54,615 INFO L87 Difference]: Start difference. First operand 2548 states and 3831 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 12:07:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:07:56,230 INFO L93 Difference]: Finished difference Result 2558 states and 3852 transitions. [2022-07-21 12:07:56,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 12:07:56,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-21 12:07:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:07:56,246 INFO L225 Difference]: With dead ends: 2558 [2022-07-21 12:07:56,246 INFO L226 Difference]: Without dead ends: 2555 [2022-07-21 12:07:56,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 12:07:56,250 INFO L413 NwaCegarLoop]: 1084 mSDtfsCounter, 1061 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 12:07:56,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1800 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-21 12:07:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2022-07-21 12:07:56,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2547. [2022-07-21 12:07:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2547 states, 1962 states have (on average 1.4648318042813455) internal successors, (2874), 1980 states have internal predecessors, (2874), 479 states have call successors, (479), 106 states have call predecessors, (479), 105 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2022-07-21 12:07:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 3829 transitions. [2022-07-21 12:07:56,341 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 3829 transitions. Word has length 26 [2022-07-21 12:07:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:07:56,342 INFO L495 AbstractCegarLoop]: Abstraction has 2547 states and 3829 transitions. [2022-07-21 12:07:56,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 12:07:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 3829 transitions. [2022-07-21 12:07:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 12:07:56,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:07:56,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 12:07:56,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 12:07:56,344 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:07:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:07:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1953265320, now seen corresponding path program 1 times [2022-07-21 12:07:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:07:56,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860197445] [2022-07-21 12:07:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:07:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:07:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:07:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 12:07:56,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:07:56,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860197445] [2022-07-21 12:07:56,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860197445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:07:56,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:07:56,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 12:07:56,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099088033] [2022-07-21 12:07:56,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:07:56,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 12:07:56,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:07:56,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 12:07:56,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 12:07:56,504 INFO L87 Difference]: Start difference. First operand 2547 states and 3829 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 12:07:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:07:59,236 INFO L93 Difference]: Finished difference Result 7585 states and 11451 transitions. [2022-07-21 12:07:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 12:07:59,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-21 12:07:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:07:59,291 INFO L225 Difference]: With dead ends: 7585 [2022-07-21 12:07:59,292 INFO L226 Difference]: Without dead ends: 5029 [2022-07-21 12:07:59,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 12:07:59,302 INFO L413 NwaCegarLoop]: 1197 mSDtfsCounter, 1126 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 12:07:59,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2805 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-21 12:07:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2022-07-21 12:07:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5004. [2022-07-21 12:07:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5004 states, 3857 states have (on average 1.467461757842883) internal successors, (5660), 3900 states have internal predecessors, (5660), 949 states have call successors, (949), 205 states have call predecessors, (949), 197 states have return successors, (939), 930 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-21 12:07:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 7548 transitions. [2022-07-21 12:07:59,464 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 7548 transitions. Word has length 27 [2022-07-21 12:07:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:07:59,465 INFO L495 AbstractCegarLoop]: Abstraction has 5004 states and 7548 transitions. [2022-07-21 12:07:59,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 12:07:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 7548 transitions. [2022-07-21 12:07:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 12:07:59,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:07:59,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 12:07:59,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 12:07:59,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:07:59,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:07:59,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1400463080, now seen corresponding path program 1 times [2022-07-21 12:07:59,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:07:59,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908378137] [2022-07-21 12:07:59,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:07:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:07:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:07:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 12:07:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:59,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:07:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:59,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:07:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:59,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 12:07:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 12:07:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:59,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:07:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:07:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 12:07:59,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:07:59,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908378137] [2022-07-21 12:07:59,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908378137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:07:59,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:07:59,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 12:07:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362207487] [2022-07-21 12:07:59,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:07:59,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 12:07:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:07:59,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 12:07:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 12:07:59,709 INFO L87 Difference]: Start difference. First operand 5004 states and 7548 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 12:08:04,773 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-21 12:08:06,865 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-21 12:08:08,956 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-21 12:08:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:08:10,708 INFO L93 Difference]: Finished difference Result 10466 states and 15931 transitions. [2022-07-21 12:08:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 12:08:10,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 77 [2022-07-21 12:08:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:08:10,738 INFO L225 Difference]: With dead ends: 10466 [2022-07-21 12:08:10,738 INFO L226 Difference]: Without dead ends: 5461 [2022-07-21 12:08:10,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 12:08:10,756 INFO L413 NwaCegarLoop]: 1101 mSDtfsCounter, 182 mSDsluCounter, 3759 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 154 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-07-21 12:08:10,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 4860 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1295 Invalid, 3 Unknown, 0 Unchecked, 10.8s Time] [2022-07-21 12:08:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2022-07-21 12:08:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 5006. [2022-07-21 12:08:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5006 states, 3859 states have (on average 1.4661829489505054) internal successors, (5658), 3902 states have internal predecessors, (5658), 949 states have call successors, (949), 205 states have call predecessors, (949), 197 states have return successors, (939), 930 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-21 12:08:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 7546 transitions. [2022-07-21 12:08:10,966 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 7546 transitions. Word has length 77 [2022-07-21 12:08:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:08:10,967 INFO L495 AbstractCegarLoop]: Abstraction has 5006 states and 7546 transitions. [2022-07-21 12:08:10,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 12:08:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 7546 transitions. [2022-07-21 12:08:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 12:08:10,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:08:10,974 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 12:08:10,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 12:08:10,974 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:08:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:08:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1710126176, now seen corresponding path program 1 times [2022-07-21 12:08:10,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:08:10,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391200735] [2022-07-21 12:08:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:08:10,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:08:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:08:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 12:08:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 12:08:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 12:08:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:08:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 12:08:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 12:08:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 12:08:11,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:08:11,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391200735] [2022-07-21 12:08:11,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391200735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:08:11,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:08:11,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 12:08:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613645288] [2022-07-21 12:08:11,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:08:11,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 12:08:11,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:08:11,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 12:08:11,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 12:08:11,202 INFO L87 Difference]: Start difference. First operand 5006 states and 7546 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 12:08:15,678 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-21 12:08:17,732 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-21 12:08:19,793 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-21 12:08:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:08:21,277 INFO L93 Difference]: Finished difference Result 11182 states and 17097 transitions. [2022-07-21 12:08:21,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 12:08:21,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 104 [2022-07-21 12:08:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:08:21,312 INFO L225 Difference]: With dead ends: 11182 [2022-07-21 12:08:21,312 INFO L226 Difference]: Without dead ends: 6179 [2022-07-21 12:08:21,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 12:08:21,331 INFO L413 NwaCegarLoop]: 1350 mSDtfsCounter, 728 mSDsluCounter, 3609 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 339 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 4959 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-07-21 12:08:21,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 4959 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1066 Invalid, 3 Unknown, 0 Unchecked, 9.9s Time] [2022-07-21 12:08:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2022-07-21 12:08:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5014. [2022-07-21 12:08:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5014 states, 3867 states have (on average 1.465218515645203) internal successors, (5666), 3910 states have internal predecessors, (5666), 949 states have call successors, (949), 205 states have call predecessors, (949), 197 states have return successors, (939), 930 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-21 12:08:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 7554 transitions. [2022-07-21 12:08:21,538 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 7554 transitions. Word has length 104 [2022-07-21 12:08:21,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:08:21,539 INFO L495 AbstractCegarLoop]: Abstraction has 5014 states and 7554 transitions. [2022-07-21 12:08:21,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 12:08:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 7554 transitions. [2022-07-21 12:08:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-21 12:08:21,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:08:21,542 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 12:08:21,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 12:08:21,542 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:08:21,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:08:21,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1744883690, now seen corresponding path program 1 times [2022-07-21 12:08:21,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:08:21,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539199531] [2022-07-21 12:08:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:08:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:08:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:08:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 12:08:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 12:08:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 12:08:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:08:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 12:08:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 12:08:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 12:08:21,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:08:21,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539199531] [2022-07-21 12:08:21,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539199531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:08:21,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:08:21,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 12:08:21,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177303523] [2022-07-21 12:08:21,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:08:21,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 12:08:21,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:08:21,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 12:08:21,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 12:08:21,721 INFO L87 Difference]: Start difference. First operand 5014 states and 7554 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 12:08:25,632 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-21 12:08:27,699 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-21 12:08:29,825 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-21 12:08:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:08:31,202 INFO L93 Difference]: Finished difference Result 10407 states and 16031 transitions. [2022-07-21 12:08:31,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 12:08:31,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 102 [2022-07-21 12:08:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:08:31,231 INFO L225 Difference]: With dead ends: 10407 [2022-07-21 12:08:31,231 INFO L226 Difference]: Without dead ends: 5396 [2022-07-21 12:08:31,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 12:08:31,257 INFO L413 NwaCegarLoop]: 1015 mSDtfsCounter, 1187 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 463 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-21 12:08:31,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 2263 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 514 Invalid, 3 Unknown, 0 Unchecked, 9.2s Time] [2022-07-21 12:08:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2022-07-21 12:08:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 4990. [2022-07-21 12:08:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4990 states, 3851 states have (on average 1.3996364580628409) internal successors, (5390), 3894 states have internal predecessors, (5390), 941 states have call successors, (941), 205 states have call predecessors, (941), 197 states have return successors, (931), 922 states have call predecessors, (931), 931 states have call successors, (931) [2022-07-21 12:08:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 7262 transitions. [2022-07-21 12:08:31,412 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 7262 transitions. Word has length 102 [2022-07-21 12:08:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:08:31,414 INFO L495 AbstractCegarLoop]: Abstraction has 4990 states and 7262 transitions. [2022-07-21 12:08:31,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 12:08:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 7262 transitions. [2022-07-21 12:08:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 12:08:31,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:08:31,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 12:08:31,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 12:08:31,421 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:08:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:08:31,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1621242927, now seen corresponding path program 1 times [2022-07-21 12:08:31,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:08:31,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820475216] [2022-07-21 12:08:31,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:08:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:08:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:08:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 12:08:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 12:08:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 12:08:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 12:08:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:08:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 12:08:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 12:08:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 12:08:31,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:08:31,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820475216] [2022-07-21 12:08:31,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820475216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:08:31,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:08:31,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 12:08:31,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615661148] [2022-07-21 12:08:31,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:08:31,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 12:08:31,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:08:31,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 12:08:31,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 12:08:31,734 INFO L87 Difference]: Start difference. First operand 4990 states and 7262 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 12:08:37,575 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-21 12:08:39,632 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-21 12:08:41,701 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-21 12:08:43,844 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-21 12:08:45,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:08:48,021 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-21 12:08:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:08:49,944 INFO L93 Difference]: Finished difference Result 15758 states and 23270 transitions. [2022-07-21 12:08:49,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 12:08:49,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 108 [2022-07-21 12:08:49,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:08:49,993 INFO L225 Difference]: With dead ends: 15758 [2022-07-21 12:08:49,994 INFO L226 Difference]: Without dead ends: 10771 [2022-07-21 12:08:50,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 12:08:50,012 INFO L413 NwaCegarLoop]: 1646 mSDtfsCounter, 1264 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 549 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 4454 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2022-07-21 12:08:50,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 4454 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1196 Invalid, 6 Unknown, 0 Unchecked, 17.8s Time] [2022-07-21 12:08:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2022-07-21 12:08:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 9936. [2022-07-21 12:08:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9936 states, 7665 states have (on average 1.3993476842791912) internal successors, (10726), 7750 states have internal predecessors, (10726), 1877 states have call successors, (1877), 407 states have call predecessors, (1877), 393 states have return successors, (1861), 1842 states have call predecessors, (1861), 1861 states have call successors, (1861) [2022-07-21 12:08:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9936 states to 9936 states and 14464 transitions. [2022-07-21 12:08:50,373 INFO L78 Accepts]: Start accepts. Automaton has 9936 states and 14464 transitions. Word has length 108 [2022-07-21 12:08:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:08:50,373 INFO L495 AbstractCegarLoop]: Abstraction has 9936 states and 14464 transitions. [2022-07-21 12:08:50,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 12:08:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9936 states and 14464 transitions. [2022-07-21 12:08:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-21 12:08:50,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:08:50,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 12:08:50,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 12:08:50,378 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:08:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:08:50,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1012080502, now seen corresponding path program 1 times [2022-07-21 12:08:50,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:08:50,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647207100] [2022-07-21 12:08:50,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:08:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:08:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:08:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 12:08:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 12:08:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 12:08:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 12:08:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:08:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 12:08:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 12:08:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:08:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:08:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 12:08:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:08:50,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647207100] [2022-07-21 12:08:50,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647207100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:08:50,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:08:50,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 12:08:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766589949] [2022-07-21 12:08:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:08:50,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 12:08:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:08:50,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 12:08:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 12:08:50,611 INFO L87 Difference]: Start difference. First operand 9936 states and 14464 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 12:08:56,344 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-21 12:08:58,397 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-21 12:09:00,477 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-21 12:09:02,597 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-21 12:09:04,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:09:06,812 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-21 12:09:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:09:08,657 INFO L93 Difference]: Finished difference Result 25936 states and 38367 transitions. [2022-07-21 12:09:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 12:09:08,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 110 [2022-07-21 12:09:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:09:08,733 INFO L225 Difference]: With dead ends: 25936 [2022-07-21 12:09:08,733 INFO L226 Difference]: Without dead ends: 16003 [2022-07-21 12:09:08,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 12:09:08,762 INFO L413 NwaCegarLoop]: 1677 mSDtfsCounter, 1190 mSDsluCounter, 2704 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 664 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 4381 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-07-21 12:09:08,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 4381 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 1213 Invalid, 6 Unknown, 0 Unchecked, 17.6s Time] [2022-07-21 12:09:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16003 states. [2022-07-21 12:09:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16003 to 14784. [2022-07-21 12:09:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14784 states, 11449 states have (on average 1.3945322735610097) internal successors, (15966), 11566 states have internal predecessors, (15966), 2761 states have call successors, (2761), 587 states have call predecessors, (2761), 573 states have return successors, (2745), 2726 states have call predecessors, (2745), 2745 states have call successors, (2745) [2022-07-21 12:09:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14784 states to 14784 states and 21472 transitions. [2022-07-21 12:09:09,341 INFO L78 Accepts]: Start accepts. Automaton has 14784 states and 21472 transitions. Word has length 110 [2022-07-21 12:09:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:09:09,343 INFO L495 AbstractCegarLoop]: Abstraction has 14784 states and 21472 transitions. [2022-07-21 12:09:09,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 12:09:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14784 states and 21472 transitions. [2022-07-21 12:09:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-21 12:09:09,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:09:09,348 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 12:09:09,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 12:09:09,349 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:09:09,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:09:09,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1582291269, now seen corresponding path program 1 times [2022-07-21 12:09:09,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:09:09,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796588743] [2022-07-21 12:09:09,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:09:09,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:09:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:09:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 12:09:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:09:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 12:09:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:09:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 12:09:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 12:09:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:09:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:09:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 12:09:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 12:09:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:09:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 12:09:09,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:09:09,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796588743] [2022-07-21 12:09:09,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796588743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:09:09,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:09:09,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 12:09:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094291887] [2022-07-21 12:09:09,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:09:09,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 12:09:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:09:09,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 12:09:09,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 12:09:09,603 INFO L87 Difference]: Start difference. First operand 14784 states and 21472 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 12:09:16,776 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-21 12:09:18,997 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-21 12:09:21,070 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-21 12:09:23,160 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-21 12:09:25,399 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-21 12:09:27,432 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-21 12:09:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:09:29,414 INFO L93 Difference]: Finished difference Result 36024 states and 53119 transitions. [2022-07-21 12:09:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 12:09:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 131 [2022-07-21 12:09:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:09:29,495 INFO L225 Difference]: With dead ends: 36024 [2022-07-21 12:09:29,495 INFO L226 Difference]: Without dead ends: 21243 [2022-07-21 12:09:29,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 12:09:29,527 INFO L413 NwaCegarLoop]: 1934 mSDtfsCounter, 1189 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 607 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 5043 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2022-07-21 12:09:29,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 5043 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 1239 Invalid, 6 Unknown, 0 Unchecked, 19.2s Time] [2022-07-21 12:09:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21243 states. [2022-07-21 12:09:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21243 to 19632. [2022-07-21 12:09:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19632 states, 15233 states have (on average 1.3921092365259633) internal successors, (21206), 15382 states have internal predecessors, (21206), 3645 states have call successors, (3645), 767 states have call predecessors, (3645), 753 states have return successors, (3629), 3610 states have call predecessors, (3629), 3629 states have call successors, (3629) [2022-07-21 12:09:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19632 states to 19632 states and 28480 transitions. [2022-07-21 12:09:30,270 INFO L78 Accepts]: Start accepts. Automaton has 19632 states and 28480 transitions. Word has length 131 [2022-07-21 12:09:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:09:30,271 INFO L495 AbstractCegarLoop]: Abstraction has 19632 states and 28480 transitions. [2022-07-21 12:09:30,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 12:09:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 19632 states and 28480 transitions. [2022-07-21 12:09:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-21 12:09:30,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:09:30,285 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-21 12:09:30,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 12:09:30,285 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:09:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:09:30,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1020367177, now seen corresponding path program 1 times [2022-07-21 12:09:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:09:30,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307697839] [2022-07-21 12:09:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:09:30,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:09:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:09:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 12:09:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:09:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 12:09:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:09:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 12:09:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 12:09:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:09:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:09:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 12:09:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:09:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:09:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 12:09:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 12:09:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:09:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 12:09:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:09:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307697839] [2022-07-21 12:09:30,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307697839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:09:30,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:09:30,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 12:09:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724691924] [2022-07-21 12:09:30,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:09:30,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 12:09:30,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:09:30,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 12:09:30,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 12:09:30,473 INFO L87 Difference]: Start difference. First operand 19632 states and 28480 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 12:09:37,921 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-21 12:09:39,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:09:41,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:09:44,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:09:46,128 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-21 12:09:48,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:09:50,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:09:52,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:09:54,439 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-21 12:09:56,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:09:58,499 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:00,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:03,360 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-21 12:10:05,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:07,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:09,963 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-21 12:10:12,948 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-21 12:10:14,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:17,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:10:21,648 INFO L93 Difference]: Finished difference Result 46112 states and 67871 transitions. [2022-07-21 12:10:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 12:10:21,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 152 [2022-07-21 12:10:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:10:21,792 INFO L225 Difference]: With dead ends: 46112 [2022-07-21 12:10:21,792 INFO L226 Difference]: Without dead ends: 26483 [2022-07-21 12:10:21,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-21 12:10:21,849 INFO L413 NwaCegarLoop]: 1734 mSDtfsCounter, 1439 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 4893 mSolverCounterSat, 834 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 3432 SdHoareTripleChecker+Invalid, 5746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 4893 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.4s IncrementalHoareTripleChecker+Time [2022-07-21 12:10:21,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 3432 Invalid, 5746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [834 Valid, 4893 Invalid, 19 Unknown, 0 Unchecked, 50.4s Time] [2022-07-21 12:10:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26483 states. [2022-07-21 12:10:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26483 to 24480. [2022-07-21 12:10:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24480 states, 19017 states have (on average 1.3906504706315401) internal successors, (26446), 19198 states have internal predecessors, (26446), 4529 states have call successors, (4529), 947 states have call predecessors, (4529), 933 states have return successors, (4513), 4494 states have call predecessors, (4513), 4513 states have call successors, (4513) [2022-07-21 12:10:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24480 states to 24480 states and 35488 transitions. [2022-07-21 12:10:22,781 INFO L78 Accepts]: Start accepts. Automaton has 24480 states and 35488 transitions. Word has length 152 [2022-07-21 12:10:22,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:10:22,782 INFO L495 AbstractCegarLoop]: Abstraction has 24480 states and 35488 transitions. [2022-07-21 12:10:22,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 12:10:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand 24480 states and 35488 transitions. [2022-07-21 12:10:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-21 12:10:22,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:10:22,791 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-07-21 12:10:22,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 12:10:22,792 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:10:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:10:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2130073905, now seen corresponding path program 1 times [2022-07-21 12:10:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:10:22,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854819025] [2022-07-21 12:10:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:10:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:10:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:10:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 12:10:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:10:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 12:10:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:10:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 12:10:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 12:10:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:10:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:10:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 12:10:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:10:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:10:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 12:10:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 12:10:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 12:10:23,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:10:23,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854819025] [2022-07-21 12:10:23,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854819025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:10:23,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:10:23,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 12:10:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748575102] [2022-07-21 12:10:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:10:23,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 12:10:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:10:23,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 12:10:23,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 12:10:23,116 INFO L87 Difference]: Start difference. First operand 24480 states and 35488 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 12:10:28,288 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-21 12:10:30,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:32,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:34,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:36,572 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-21 12:10:38,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:40,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:42,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:44,884 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-21 12:10:46,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:48,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:50,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:10:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:10:53,355 INFO L93 Difference]: Finished difference Result 50943 states and 74695 transitions. [2022-07-21 12:10:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 12:10:53,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2022-07-21 12:10:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:10:53,503 INFO L225 Difference]: With dead ends: 50943 [2022-07-21 12:10:53,504 INFO L226 Difference]: Without dead ends: 26466 [2022-07-21 12:10:53,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-07-21 12:10:53,549 INFO L413 NwaCegarLoop]: 937 mSDtfsCounter, 1762 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 1094 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1094 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.4s IncrementalHoareTripleChecker+Time [2022-07-21 12:10:53,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 2182 Invalid, 4129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1094 Valid, 3024 Invalid, 11 Unknown, 0 Unchecked, 29.4s Time] [2022-07-21 12:10:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26466 states. [2022-07-21 12:10:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26466 to 24480. [2022-07-21 12:10:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24480 states, 19017 states have (on average 1.3904401325130147) internal successors, (26442), 19198 states have internal predecessors, (26442), 4529 states have call successors, (4529), 947 states have call predecessors, (4529), 933 states have return successors, (4513), 4494 states have call predecessors, (4513), 4513 states have call successors, (4513) [2022-07-21 12:10:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24480 states to 24480 states and 35484 transitions. [2022-07-21 12:10:54,603 INFO L78 Accepts]: Start accepts. Automaton has 24480 states and 35484 transitions. Word has length 153 [2022-07-21 12:10:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:10:54,605 INFO L495 AbstractCegarLoop]: Abstraction has 24480 states and 35484 transitions. [2022-07-21 12:10:54,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 12:10:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 24480 states and 35484 transitions. [2022-07-21 12:10:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-21 12:10:54,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:10:54,614 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-21 12:10:54,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 12:10:54,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:10:54,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:10:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash 574017791, now seen corresponding path program 1 times [2022-07-21 12:10:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:10:54,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697824788] [2022-07-21 12:10:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:10:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:10:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:10:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 12:10:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:10:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 12:10:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:10:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 12:10:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 12:10:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:10:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:10:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 12:10:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:10:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:10:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 12:10:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 12:10:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:10:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 12:10:54,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:10:54,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697824788] [2022-07-21 12:10:54,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697824788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:10:54,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:10:54,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 12:10:54,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544812255] [2022-07-21 12:10:54,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:10:54,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 12:10:54,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:10:54,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 12:10:54,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 12:10:54,839 INFO L87 Difference]: Start difference. First operand 24480 states and 35484 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 12:11:02,487 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-21 12:11:04,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:06,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:08,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:10,746 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-21 12:11:12,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:14,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:16,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:19,046 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-21 12:11:21,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:23,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:25,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:27,933 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-21 12:11:29,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:31,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:34,566 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-21 12:11:36,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:37,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:39,894 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-21 12:11:41,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:43,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:11:48,270 INFO L93 Difference]: Finished difference Result 56200 states and 82615 transitions. [2022-07-21 12:11:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 12:11:48,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 152 [2022-07-21 12:11:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:11:48,385 INFO L225 Difference]: With dead ends: 56200 [2022-07-21 12:11:48,385 INFO L226 Difference]: Without dead ends: 31723 [2022-07-21 12:11:48,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-21 12:11:48,439 INFO L413 NwaCegarLoop]: 1725 mSDtfsCounter, 1439 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 4924 mSolverCounterSat, 835 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 3383 SdHoareTripleChecker+Invalid, 5779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 835 IncrementalHoareTripleChecker+Valid, 4924 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.4s IncrementalHoareTripleChecker+Time [2022-07-21 12:11:48,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 3383 Invalid, 5779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [835 Valid, 4924 Invalid, 20 Unknown, 0 Unchecked, 52.4s Time] [2022-07-21 12:11:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31723 states. [2022-07-21 12:11:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31723 to 29328. [2022-07-21 12:11:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29328 states, 22801 states have (on average 1.389500460506118) internal successors, (31682), 23014 states have internal predecessors, (31682), 5413 states have call successors, (5413), 1127 states have call predecessors, (5413), 1113 states have return successors, (5397), 5378 states have call predecessors, (5397), 5397 states have call successors, (5397) [2022-07-21 12:11:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29328 states to 29328 states and 42492 transitions. [2022-07-21 12:11:49,618 INFO L78 Accepts]: Start accepts. Automaton has 29328 states and 42492 transitions. Word has length 152 [2022-07-21 12:11:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:11:49,620 INFO L495 AbstractCegarLoop]: Abstraction has 29328 states and 42492 transitions. [2022-07-21 12:11:49,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 12:11:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 29328 states and 42492 transitions. [2022-07-21 12:11:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-21 12:11:49,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:11:49,651 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-21 12:11:49,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 12:11:49,652 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:11:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:11:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash 440004285, now seen corresponding path program 1 times [2022-07-21 12:11:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:11:49,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127428030] [2022-07-21 12:11:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:11:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:11:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 12:11:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 12:11:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:11:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 12:11:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:11:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 12:11:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 12:11:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:11:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:11:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 12:11:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:11:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:11:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 12:11:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 12:11:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:11:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 12:11:49,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:11:49,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127428030] [2022-07-21 12:11:49,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127428030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:11:49,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:11:49,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 12:11:49,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281297264] [2022-07-21 12:11:49,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:11:49,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 12:11:49,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:11:49,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 12:11:49,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 12:11:49,853 INFO L87 Difference]: Start difference. First operand 29328 states and 42492 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 12:11:55,294 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-21 12:11:57,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:11:59,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:12:01,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 12:12:03,571 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-21 12:12:05,596 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 []