./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.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 c8ebe8fd9a8e0d537f351c5a7c305717ff0a45de7ead6b00d56cae7f5bf422b2 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 22:41:58,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 22:41:58,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 22:41:58,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 22:41:58,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 22:41:58,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 22:41:58,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 22:41:58,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 22:41:58,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 22:41:58,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 22:41:58,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 22:41:58,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 22:41:58,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 22:41:58,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 22:41:58,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 22:41:58,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 22:41:58,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 22:41:58,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 22:41:58,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 22:41:58,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 22:41:58,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 22:41:58,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 22:41:58,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 22:41:58,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 22:41:58,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 22:41:58,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 22:41:58,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 22:41:58,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 22:41:58,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 22:41:58,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 22:41:58,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 22:41:58,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 22:41:58,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 22:41:58,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 22:41:58,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 22:41:58,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 22:41:58,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 22:41:58,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 22:41:58,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 22:41:58,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 22:41:58,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 22:41:58,966 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 22:41:58,991 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 22:41:58,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 22:41:58,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 22:41:58,995 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 22:41:58,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 22:41:58,996 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 22:41:58,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 22:41:58,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 22:41:58,997 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 22:41:58,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 22:41:58,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 22:41:58,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 22:41:58,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 22:41:58,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 22:41:58,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 22:41:58,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 22:41:58,998 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 22:41:58,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 22:41:58,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 22:41:58,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 22:41:58,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 22:41:58,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 22:41:58,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 22:41:59,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 22:41:59,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 22:41:59,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 22:41:59,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 22:41:59,000 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 22:41:59,000 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 22:41:59,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 22:41:59,001 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 22:41:59,001 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 -> c8ebe8fd9a8e0d537f351c5a7c305717ff0a45de7ead6b00d56cae7f5bf422b2 [2021-11-16 22:41:59,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 22:41:59,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 22:41:59,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 22:41:59,221 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 22:41:59,222 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 22:41:59,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i [2021-11-16 22:41:59,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76f128cd/de2b817aab8b41c7bea4ccd345b58159/FLAG3358c89ec [2021-11-16 22:42:00,191 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 22:42:00,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i [2021-11-16 22:42:00,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76f128cd/de2b817aab8b41c7bea4ccd345b58159/FLAG3358c89ec [2021-11-16 22:42:00,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76f128cd/de2b817aab8b41c7bea4ccd345b58159 [2021-11-16 22:42:00,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 22:42:00,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 22:42:00,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 22:42:00,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 22:42:00,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 22:42:00,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:42:00" (1/1) ... [2021-11-16 22:42:00,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7530efda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:00, skipping insertion in model container [2021-11-16 22:42:00,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:42:00" (1/1) ... [2021-11-16 22:42:00,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 22:42:00,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 22:42:14,800 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-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i[1057113,1057126] [2021-11-16 22:42:15,349 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 22:42:15,420 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 22:42:16,478 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-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i[1057113,1057126] [2021-11-16 22:42:16,511 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 22:42:17,111 INFO L208 MainTranslator]: Completed translation [2021-11-16 22:42:17,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17 WrapperNode [2021-11-16 22:42:17,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 22:42:17,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 22:42:17,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 22:42:17,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 22:42:17,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (1/1) ... [2021-11-16 22:42:17,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (1/1) ... [2021-11-16 22:42:17,542 INFO L137 Inliner]: procedures = 1364, calls = 15139, calls flagged for inlining = 461, calls inlined = 24, statements flattened = 6279 [2021-11-16 22:42:17,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 22:42:17,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 22:42:17,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 22:42:17,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 22:42:17,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (1/1) ... [2021-11-16 22:42:17,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (1/1) ... [2021-11-16 22:42:17,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (1/1) ... [2021-11-16 22:42:17,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (1/1) ... [2021-11-16 22:42:17,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (1/1) ... [2021-11-16 22:42:17,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (1/1) ... [2021-11-16 22:42:17,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (1/1) ... [2021-11-16 22:42:17,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 22:42:17,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 22:42:17,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 22:42:17,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 22:42:17,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (1/1) ... [2021-11-16 22:42:17,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 22:42:17,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:42:17,782 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) [2021-11-16 22:42:17,793 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 [2021-11-16 22:42:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure device_lock___5 [2021-11-16 22:42:17,816 INFO L138 BoogieDeclarations]: Found implementation of procedure device_lock___5 [2021-11-16 22:42:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_usb_bus_list_lock [2021-11-16 22:42:17,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_usb_bus_list_lock [2021-11-16 22:42:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2021-11-16 22:42:17,816 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2021-11-16 22:42:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure usb_device_poll [2021-11-16 22:42:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_device_poll [2021-11-16 22:42:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure device_unlock___5 [2021-11-16 22:42:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure device_unlock___5 [2021-11-16 22:42:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2021-11-16 22:42:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2021-11-16 22:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 22:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2021-11-16 22:42:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2021-11-16 22:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hub_find_child [2021-11-16 22:42:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hub_find_child [2021-11-16 22:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 22:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 22:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 22:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-16 22:42:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex [2021-11-16 22:42:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex [2021-11-16 22:42:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 22:42:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 22:42:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2021-11-16 22:42:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2021-11-16 22:42:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-16 22:42:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-16 22:42:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2021-11-16 22:42:17,820 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2021-11-16 22:42:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 22:42:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 22:42:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure hdev_to_hub [2021-11-16 22:42:17,820 INFO L138 BoogieDeclarations]: Found implementation of procedure hdev_to_hub [2021-11-16 22:42:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure __get_free_pages [2021-11-16 22:42:17,820 INFO L138 BoogieDeclarations]: Found implementation of procedure __get_free_pages [2021-11-16 22:42:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 22:42:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-16 22:42:17,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-16 22:42:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-16 22:42:17,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-16 22:42:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2021-11-16 22:42:17,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2021-11-16 22:42:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 22:42:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_usb_bus_list_lock [2021-11-16 22:42:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_usb_bus_list_lock [2021-11-16 22:42:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_i_mutex [2021-11-16 22:42:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_i_mutex [2021-11-16 22:42:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure usb_device_dump [2021-11-16 22:42:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_device_dump [2021-11-16 22:42:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2021-11-16 22:42:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2021-11-16 22:42:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-16 22:42:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex [2021-11-16 22:42:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex [2021-11-16 22:42:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2021-11-16 22:42:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2021-11-16 22:42:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure class_decode [2021-11-16 22:42:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure class_decode [2021-11-16 22:42:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2021-11-16 22:42:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2021-11-16 22:42:17,825 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-11-16 22:42:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-11-16 22:42:17,825 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_type [2021-11-16 22:42:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_type [2021-11-16 22:42:17,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 22:42:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 22:42:17,825 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2021-11-16 22:42:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2021-11-16 22:42:17,826 INFO L130 BoogieDeclarations]: Found specification of procedure bus_to_hcd [2021-11-16 22:42:17,826 INFO L138 BoogieDeclarations]: Found implementation of procedure bus_to_hcd [2021-11-16 22:42:17,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_i_mutex [2021-11-16 22:42:17,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_i_mutex [2021-11-16 22:42:17,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 22:42:17,826 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-11-16 22:42:17,826 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-11-16 22:42:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2021-11-16 22:42:17,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2021-11-16 22:42:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure free_pages [2021-11-16 22:42:17,827 INFO L138 BoogieDeclarations]: Found implementation of procedure free_pages [2021-11-16 22:42:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 22:42:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2021-11-16 22:42:17,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2021-11-16 22:42:18,223 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 22:42:18,225 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 22:47:07,766 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 22:47:07,774 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 22:47:07,774 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-16 22:47:07,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:47:07 BoogieIcfgContainer [2021-11-16 22:47:07,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 22:47:07,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 22:47:07,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 22:47:07,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 22:47:07,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:42:00" (1/3) ... [2021-11-16 22:47:07,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3570dacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:47:07, skipping insertion in model container [2021-11-16 22:47:07,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:17" (2/3) ... [2021-11-16 22:47:07,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3570dacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:47:07, skipping insertion in model container [2021-11-16 22:47:07,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:47:07" (3/3) ... [2021-11-16 22:47:07,782 INFO L111 eAbstractionObserver]: Analyzing ICFG main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i [2021-11-16 22:47:07,786 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 22:47:07,786 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 22:47:07,845 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 22:47:07,850 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 22:47:07,851 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 22:47:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 392 states, 288 states have (on average 1.4097222222222223) internal successors, (406), 307 states have internal predecessors, (406), 67 states have call successors, (67), 35 states have call predecessors, (67), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-16 22:47:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-16 22:47:07,887 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:07,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:47:07,888 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:07,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash 847407800, now seen corresponding path program 1 times [2021-11-16 22:47:07,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:07,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058530965] [2021-11-16 22:47:07,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:07,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:47:09,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:09,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058530965] [2021-11-16 22:47:09,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058530965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:09,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:09,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:47:09,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091312385] [2021-11-16 22:47:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:09,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:09,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:09,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:09,188 INFO L87 Difference]: Start difference. First operand has 392 states, 288 states have (on average 1.4097222222222223) internal successors, (406), 307 states have internal predecessors, (406), 67 states have call successors, (67), 35 states have call predecessors, (67), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:11,445 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:13,568 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:14,356 INFO L93 Difference]: Finished difference Result 784 states and 1108 transitions. [2021-11-16 22:47:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:47:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-11-16 22:47:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:14,372 INFO L225 Difference]: With dead ends: 784 [2021-11-16 22:47:14,372 INFO L226 Difference]: Without dead ends: 392 [2021-11-16 22:47:14,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:47:14,378 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 748 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 149 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:14,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 523 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2021-11-16 22:47:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-11-16 22:47:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 383. [2021-11-16 22:47:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 283 states have (on average 1.4028268551236749) internal successors, (397), 299 states have internal predecessors, (397), 66 states have call successors, (66), 35 states have call predecessors, (66), 33 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-11-16 22:47:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 512 transitions. [2021-11-16 22:47:14,467 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 512 transitions. Word has length 12 [2021-11-16 22:47:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:14,468 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 512 transitions. [2021-11-16 22:47:14,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 512 transitions. [2021-11-16 22:47:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-16 22:47:14,469 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:14,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:47:14,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 22:47:14,470 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 499469767, now seen corresponding path program 1 times [2021-11-16 22:47:14,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:14,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53083538] [2021-11-16 22:47:14,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:14,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:15,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:47:15,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:15,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53083538] [2021-11-16 22:47:15,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53083538] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:15,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:15,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:47:15,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515566030] [2021-11-16 22:47:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:15,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:15,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:15,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:15,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:15,058 INFO L87 Difference]: Start difference. First operand 383 states and 512 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:17,266 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:19,401 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:19,934 INFO L93 Difference]: Finished difference Result 394 states and 527 transitions. [2021-11-16 22:47:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:47:19,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-11-16 22:47:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:19,937 INFO L225 Difference]: With dead ends: 394 [2021-11-16 22:47:19,937 INFO L226 Difference]: Without dead ends: 391 [2021-11-16 22:47:19,938 INFO L932 BasicCegarLoop]: 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 [2021-11-16 22:47:19,938 INFO L933 BasicCegarLoop]: 440 mSDtfsCounter, 738 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 147 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:19,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [755 Valid, 515 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2021-11-16 22:47:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-11-16 22:47:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 382. [2021-11-16 22:47:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 283 states have (on average 1.3992932862190812) internal successors, (396), 298 states have internal predecessors, (396), 65 states have call successors, (65), 35 states have call predecessors, (65), 33 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-11-16 22:47:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 510 transitions. [2021-11-16 22:47:19,964 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 510 transitions. Word has length 13 [2021-11-16 22:47:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:19,965 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 510 transitions. [2021-11-16 22:47:19,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 510 transitions. [2021-11-16 22:47:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-16 22:47:19,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:19,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:47:19,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-16 22:47:19,967 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:19,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:19,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1696669797, now seen corresponding path program 1 times [2021-11-16 22:47:19,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:19,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83744271] [2021-11-16 22:47:19,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:19,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:20,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:47:20,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:20,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83744271] [2021-11-16 22:47:20,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83744271] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:20,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:20,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:47:20,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769061601] [2021-11-16 22:47:20,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:20,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:20,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:20,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:20,558 INFO L87 Difference]: Start difference. First operand 382 states and 510 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:22,780 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:24,945 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:25,573 INFO L93 Difference]: Finished difference Result 393 states and 525 transitions. [2021-11-16 22:47:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:47:25,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-16 22:47:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:25,575 INFO L225 Difference]: With dead ends: 393 [2021-11-16 22:47:25,576 INFO L226 Difference]: Without dead ends: 390 [2021-11-16 22:47:25,576 INFO L932 BasicCegarLoop]: 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 [2021-11-16 22:47:25,577 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 735 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 145 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:25,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 514 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2021-11-16 22:47:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-16 22:47:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 381. [2021-11-16 22:47:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 283 states have (on average 1.3957597173144876) internal successors, (395), 297 states have internal predecessors, (395), 64 states have call successors, (64), 35 states have call predecessors, (64), 33 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-11-16 22:47:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 508 transitions. [2021-11-16 22:47:25,594 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 508 transitions. Word has length 14 [2021-11-16 22:47:25,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:25,594 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 508 transitions. [2021-11-16 22:47:25,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 508 transitions. [2021-11-16 22:47:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-16 22:47:25,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:25,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:47:25,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-16 22:47:25,595 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:25,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1057514678, now seen corresponding path program 1 times [2021-11-16 22:47:25,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:25,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137915339] [2021-11-16 22:47:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:25,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:26,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:47:26,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:26,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137915339] [2021-11-16 22:47:26,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137915339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:26,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:26,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:47:26,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296725675] [2021-11-16 22:47:26,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:26,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:26,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:26,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:26,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:26,204 INFO L87 Difference]: Start difference. First operand 381 states and 508 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:28,446 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:30,598 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:31,157 INFO L93 Difference]: Finished difference Result 397 states and 526 transitions. [2021-11-16 22:47:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:47:31,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-11-16 22:47:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:31,160 INFO L225 Difference]: With dead ends: 397 [2021-11-16 22:47:31,160 INFO L226 Difference]: Without dead ends: 393 [2021-11-16 22:47:31,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:47:31,162 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 712 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 142 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:31,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 530 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2021-11-16 22:47:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-11-16 22:47:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 382. [2021-11-16 22:47:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 285 states have (on average 1.3859649122807018) internal successors, (395), 297 states have internal predecessors, (395), 62 states have call successors, (62), 36 states have call predecessors, (62), 34 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-11-16 22:47:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 506 transitions. [2021-11-16 22:47:31,184 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 506 transitions. Word has length 15 [2021-11-16 22:47:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:31,184 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 506 transitions. [2021-11-16 22:47:31,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 506 transitions. [2021-11-16 22:47:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-16 22:47:31,186 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:31,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:47:31,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 22:47:31,186 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:31,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:31,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1576429694, now seen corresponding path program 1 times [2021-11-16 22:47:31,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:31,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569697168] [2021-11-16 22:47:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:31,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:31,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:47:31,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:31,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569697168] [2021-11-16 22:47:31,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569697168] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:31,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:31,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:47:31,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468953531] [2021-11-16 22:47:31,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:31,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:31,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:31,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:31,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:31,743 INFO L87 Difference]: Start difference. First operand 382 states and 506 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:33,946 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:36,118 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:36,739 INFO L93 Difference]: Finished difference Result 393 states and 521 transitions. [2021-11-16 22:47:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:47:36,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-11-16 22:47:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:36,742 INFO L225 Difference]: With dead ends: 393 [2021-11-16 22:47:36,742 INFO L226 Difference]: Without dead ends: 390 [2021-11-16 22:47:36,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:47:36,743 INFO L933 BasicCegarLoop]: 436 mSDtfsCounter, 727 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 139 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:36,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 511 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 127 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2021-11-16 22:47:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-16 22:47:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 381. [2021-11-16 22:47:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 285 states have (on average 1.3824561403508773) internal successors, (394), 296 states have internal predecessors, (394), 61 states have call successors, (61), 36 states have call predecessors, (61), 34 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-11-16 22:47:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 504 transitions. [2021-11-16 22:47:36,758 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 504 transitions. Word has length 16 [2021-11-16 22:47:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:36,759 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 504 transitions. [2021-11-16 22:47:36,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 504 transitions. [2021-11-16 22:47:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-16 22:47:36,759 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:36,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:47:36,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-16 22:47:36,760 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1624331469, now seen corresponding path program 1 times [2021-11-16 22:47:36,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:36,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917789204] [2021-11-16 22:47:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:36,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:37,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:47:37,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:37,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917789204] [2021-11-16 22:47:37,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917789204] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:37,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:37,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:47:37,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997424944] [2021-11-16 22:47:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:37,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:37,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:37,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:37,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:37,324 INFO L87 Difference]: Start difference. First operand 381 states and 504 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:39,568 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:41,722 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:42,241 INFO L93 Difference]: Finished difference Result 392 states and 519 transitions. [2021-11-16 22:47:42,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:47:42,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-11-16 22:47:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:42,245 INFO L225 Difference]: With dead ends: 392 [2021-11-16 22:47:42,245 INFO L226 Difference]: Without dead ends: 389 [2021-11-16 22:47:42,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:47:42,246 INFO L933 BasicCegarLoop]: 435 mSDtfsCounter, 724 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 137 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:42,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [741 Valid, 510 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2021-11-16 22:47:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-16 22:47:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 380. [2021-11-16 22:47:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 285 states have (on average 1.3789473684210527) internal successors, (393), 295 states have internal predecessors, (393), 60 states have call successors, (60), 36 states have call predecessors, (60), 34 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-11-16 22:47:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 502 transitions. [2021-11-16 22:47:42,260 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 502 transitions. Word has length 17 [2021-11-16 22:47:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:42,260 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 502 transitions. [2021-11-16 22:47:42,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 502 transitions. [2021-11-16 22:47:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-16 22:47:42,261 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:42,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:47:42,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 22:47:42,262 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1185675935, now seen corresponding path program 1 times [2021-11-16 22:47:42,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:42,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658831539] [2021-11-16 22:47:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:42,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:42,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:47:42,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:42,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658831539] [2021-11-16 22:47:42,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658831539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:42,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:42,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:47:42,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939334561] [2021-11-16 22:47:42,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:42,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:42,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:42,712 INFO L87 Difference]: Start difference. First operand 380 states and 502 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:44,911 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:47,089 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:49,844 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:50,301 INFO L93 Difference]: Finished difference Result 817 states and 1077 transitions. [2021-11-16 22:47:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:47:50,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-11-16 22:47:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:50,304 INFO L225 Difference]: With dead ends: 817 [2021-11-16 22:47:50,304 INFO L226 Difference]: Without dead ends: 443 [2021-11-16 22:47:50,305 INFO L932 BasicCegarLoop]: 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 [2021-11-16 22:47:50,306 INFO L933 BasicCegarLoop]: 498 mSDtfsCounter, 507 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 96 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:50,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 593 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 419 Invalid, 3 Unknown, 0 Unchecked, 7.5s Time] [2021-11-16 22:47:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-11-16 22:47:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2021-11-16 22:47:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 336 states have internal predecessors, (442), 70 states have call successors, (70), 47 states have call predecessors, (70), 42 states have return successors, (59), 57 states have call predecessors, (59), 57 states have call successors, (59) [2021-11-16 22:47:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 571 transitions. [2021-11-16 22:47:50,330 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 571 transitions. Word has length 18 [2021-11-16 22:47:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:50,330 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 571 transitions. [2021-11-16 22:47:50,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 571 transitions. [2021-11-16 22:47:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-16 22:47:50,332 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:50,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:47:50,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 22:47:50,332 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1898412624, now seen corresponding path program 1 times [2021-11-16 22:47:50,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:50,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685227457] [2021-11-16 22:47:50,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:50,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:50,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:47:50,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:50,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685227457] [2021-11-16 22:47:50,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685227457] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:50,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:50,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:47:50,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886468226] [2021-11-16 22:47:50,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:50,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:50,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:50,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:50,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:50,860 INFO L87 Difference]: Start difference. First operand 440 states and 571 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:53,103 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:55,297 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:47:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:55,887 INFO L93 Difference]: Finished difference Result 442 states and 572 transitions. [2021-11-16 22:47:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:47:55,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-11-16 22:47:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:55,889 INFO L225 Difference]: With dead ends: 442 [2021-11-16 22:47:55,889 INFO L226 Difference]: Without dead ends: 439 [2021-11-16 22:47:55,890 INFO L932 BasicCegarLoop]: 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 [2021-11-16 22:47:55,890 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 718 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 133 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:55,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [735 Valid, 508 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2021-11-16 22:47:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-11-16 22:47:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2021-11-16 22:47:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 327 states have (on average 1.348623853211009) internal successors, (441), 335 states have internal predecessors, (441), 69 states have call successors, (69), 47 states have call predecessors, (69), 42 states have return successors, (59), 57 states have call predecessors, (59), 57 states have call successors, (59) [2021-11-16 22:47:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 569 transitions. [2021-11-16 22:47:55,911 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 569 transitions. Word has length 19 [2021-11-16 22:47:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:55,911 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 569 transitions. [2021-11-16 22:47:55,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 569 transitions. [2021-11-16 22:47:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-16 22:47:55,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:55,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:47:55,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-16 22:47:55,915 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:55,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1279084988, now seen corresponding path program 1 times [2021-11-16 22:47:55,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:55,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109974164] [2021-11-16 22:47:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:55,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:47:56,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:56,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109974164] [2021-11-16 22:47:56,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109974164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:56,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:56,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:47:56,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699187049] [2021-11-16 22:47:56,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:56,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:56,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:56,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:56,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:56,389 INFO L87 Difference]: Start difference. First operand 439 states and 569 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:47:58,595 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:00,770 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:48:01,304 INFO L93 Difference]: Finished difference Result 441 states and 570 transitions. [2021-11-16 22:48:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:48:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-11-16 22:48:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:48:01,307 INFO L225 Difference]: With dead ends: 441 [2021-11-16 22:48:01,307 INFO L226 Difference]: Without dead ends: 438 [2021-11-16 22:48:01,307 INFO L932 BasicCegarLoop]: 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 [2021-11-16 22:48:01,307 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 715 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 131 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:48:01,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [732 Valid, 507 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 123 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2021-11-16 22:48:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-11-16 22:48:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2021-11-16 22:48:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 327 states have (on average 1.345565749235474) internal successors, (440), 334 states have internal predecessors, (440), 68 states have call successors, (68), 47 states have call predecessors, (68), 42 states have return successors, (59), 57 states have call predecessors, (59), 57 states have call successors, (59) [2021-11-16 22:48:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 567 transitions. [2021-11-16 22:48:01,328 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 567 transitions. Word has length 20 [2021-11-16 22:48:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:48:01,329 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 567 transitions. [2021-11-16 22:48:01,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:48:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 567 transitions. [2021-11-16 22:48:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-16 22:48:01,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:48:01,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:48:01,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-16 22:48:01,331 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:48:01,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:48:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash -997258285, now seen corresponding path program 1 times [2021-11-16 22:48:01,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:48:01,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919620194] [2021-11-16 22:48:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:48:01,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:48:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:01,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:48:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:48:01,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:48:01,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919620194] [2021-11-16 22:48:01,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919620194] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:48:01,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:48:01,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:48:01,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096820909] [2021-11-16 22:48:01,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:48:01,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:48:01,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:48:01,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:48:01,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:48:01,911 INFO L87 Difference]: Start difference. First operand 438 states and 567 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:48:04,144 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:06,307 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:09,129 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:48:09,441 INFO L93 Difference]: Finished difference Result 445 states and 571 transitions. [2021-11-16 22:48:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:48:09,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-11-16 22:48:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:48:09,443 INFO L225 Difference]: With dead ends: 445 [2021-11-16 22:48:09,443 INFO L226 Difference]: Without dead ends: 441 [2021-11-16 22:48:09,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:48:09,444 INFO L933 BasicCegarLoop]: 442 mSDtfsCounter, 406 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 66 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2021-11-16 22:48:09,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 561 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 416 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2021-11-16 22:48:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-11-16 22:48:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2021-11-16 22:48:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 329 states have (on average 1.337386018237082) internal successors, (440), 334 states have internal predecessors, (440), 66 states have call successors, (66), 48 states have call predecessors, (66), 43 states have return successors, (59), 57 states have call predecessors, (59), 57 states have call successors, (59) [2021-11-16 22:48:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 565 transitions. [2021-11-16 22:48:09,483 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 565 transitions. Word has length 21 [2021-11-16 22:48:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:48:09,484 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 565 transitions. [2021-11-16 22:48:09,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:48:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 565 transitions. [2021-11-16 22:48:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-16 22:48:09,486 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:48:09,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:48:09,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-16 22:48:09,486 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:48:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:48:09,487 INFO L85 PathProgramCache]: Analyzing trace with hash -850560217, now seen corresponding path program 1 times [2021-11-16 22:48:09,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:48:09,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819002759] [2021-11-16 22:48:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:48:09,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:48:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:09,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:48:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:48:09,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:48:09,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819002759] [2021-11-16 22:48:09,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819002759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:48:09,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:48:09,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:48:09,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530443391] [2021-11-16 22:48:09,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:48:09,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:48:09,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:48:09,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:48:09,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:48:09,935 INFO L87 Difference]: Start difference. First operand 439 states and 565 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:48:12,155 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:14,309 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:48:14,903 INFO L93 Difference]: Finished difference Result 441 states and 566 transitions. [2021-11-16 22:48:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:48:14,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-11-16 22:48:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:48:14,905 INFO L225 Difference]: With dead ends: 441 [2021-11-16 22:48:14,906 INFO L226 Difference]: Without dead ends: 426 [2021-11-16 22:48:14,906 INFO L932 BasicCegarLoop]: 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 [2021-11-16 22:48:14,906 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 707 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 125 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:48:14,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [724 Valid, 504 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2021-11-16 22:48:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-11-16 22:48:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2021-11-16 22:48:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 318 states have (on average 1.3427672955974843) internal successors, (427), 322 states have internal predecessors, (427), 64 states have call successors, (64), 47 states have call predecessors, (64), 43 states have return successors, (59), 57 states have call predecessors, (59), 57 states have call successors, (59) [2021-11-16 22:48:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 550 transitions. [2021-11-16 22:48:14,923 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 550 transitions. Word has length 22 [2021-11-16 22:48:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:48:14,923 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 550 transitions. [2021-11-16 22:48:14,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-16 22:48:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 550 transitions. [2021-11-16 22:48:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-16 22:48:14,924 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:48:14,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:48:14,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-16 22:48:14,925 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:48:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:48:14,925 INFO L85 PathProgramCache]: Analyzing trace with hash 492746036, now seen corresponding path program 1 times [2021-11-16 22:48:14,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:48:14,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822693783] [2021-11-16 22:48:14,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:48:14,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:48:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:15,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:48:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:15,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 22:48:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:15,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 22:48:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:15,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 22:48:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:48:15,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:48:15,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822693783] [2021-11-16 22:48:15,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822693783] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:48:15,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:48:15,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:48:15,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180163006] [2021-11-16 22:48:15,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:48:15,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:48:15,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:48:15,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:48:15,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:48:15,543 INFO L87 Difference]: Start difference. First operand 426 states and 550 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 22:48:17,825 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:20,688 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:48:21,077 INFO L93 Difference]: Finished difference Result 859 states and 1115 transitions. [2021-11-16 22:48:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:48:21,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2021-11-16 22:48:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:48:21,080 INFO L225 Difference]: With dead ends: 859 [2021-11-16 22:48:21,080 INFO L226 Difference]: Without dead ends: 439 [2021-11-16 22:48:21,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:48:21,081 INFO L933 BasicCegarLoop]: 436 mSDtfsCounter, 630 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 138 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-11-16 22:48:21,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [674 Valid, 600 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 436 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2021-11-16 22:48:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-11-16 22:48:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2021-11-16 22:48:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 329 states have (on average 1.343465045592705) internal successors, (442), 333 states have internal predecessors, (442), 66 states have call successors, (66), 47 states have call predecessors, (66), 43 states have return successors, (61), 59 states have call predecessors, (61), 59 states have call successors, (61) [2021-11-16 22:48:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 569 transitions. [2021-11-16 22:48:21,098 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 569 transitions. Word has length 34 [2021-11-16 22:48:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:48:21,098 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 569 transitions. [2021-11-16 22:48:21,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 22:48:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 569 transitions. [2021-11-16 22:48:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-16 22:48:21,099 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:48:21,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:48:21,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-16 22:48:21,100 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:48:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:48:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash -570027568, now seen corresponding path program 1 times [2021-11-16 22:48:21,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:48:21,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121262136] [2021-11-16 22:48:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:48:21,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:48:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:21,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:48:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:21,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 22:48:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:48:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:21,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-16 22:48:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 22:48:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:48:21,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:48:21,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121262136] [2021-11-16 22:48:21,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121262136] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:48:21,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:48:21,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:48:21,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729084830] [2021-11-16 22:48:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:48:21,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:48:21,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:48:21,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:48:21,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:48:21,790 INFO L87 Difference]: Start difference. First operand 439 states and 569 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-16 22:48:24,008 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:26,209 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:29,057 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:48:29,409 INFO L93 Difference]: Finished difference Result 873 states and 1133 transitions. [2021-11-16 22:48:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:48:29,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2021-11-16 22:48:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:48:29,411 INFO L225 Difference]: With dead ends: 873 [2021-11-16 22:48:29,411 INFO L226 Difference]: Without dead ends: 440 [2021-11-16 22:48:29,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:48:29,413 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 304 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 63 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2021-11-16 22:48:29,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 711 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 457 Invalid, 3 Unknown, 0 Unchecked, 7.6s Time] [2021-11-16 22:48:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-11-16 22:48:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 439. [2021-11-16 22:48:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 329 states have (on average 1.3343465045592706) internal successors, (439), 333 states have internal predecessors, (439), 66 states have call successors, (66), 47 states have call predecessors, (66), 43 states have return successors, (61), 59 states have call predecessors, (61), 59 states have call successors, (61) [2021-11-16 22:48:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 566 transitions. [2021-11-16 22:48:29,431 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 566 transitions. Word has length 43 [2021-11-16 22:48:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:48:29,431 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 566 transitions. [2021-11-16 22:48:29,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-16 22:48:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 566 transitions. [2021-11-16 22:48:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-16 22:48:29,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:48:29,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:48:29,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-16 22:48:29,433 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:48:29,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:48:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash -423857566, now seen corresponding path program 1 times [2021-11-16 22:48:29,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:48:29,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004147175] [2021-11-16 22:48:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:48:29,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:48:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:30,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:48:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:30,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 22:48:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 22:48:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:30,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 22:48:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:30,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-16 22:48:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:48:30,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:48:30,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004147175] [2021-11-16 22:48:30,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004147175] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:48:30,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:48:30,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:48:30,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329304257] [2021-11-16 22:48:30,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:48:30,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:48:30,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:48:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:48:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:48:30,154 INFO L87 Difference]: Start difference. First operand 439 states and 566 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-16 22:48:32,382 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:34,540 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:48:35,163 INFO L93 Difference]: Finished difference Result 443 states and 568 transitions. [2021-11-16 22:48:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 22:48:35,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2021-11-16 22:48:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:48:35,166 INFO L225 Difference]: With dead ends: 443 [2021-11-16 22:48:35,166 INFO L226 Difference]: Without dead ends: 440 [2021-11-16 22:48:35,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:48:35,167 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 876 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 215 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:48:35,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [883 Valid, 577 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 152 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2021-11-16 22:48:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-11-16 22:48:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2021-11-16 22:48:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 329 states have (on average 1.331306990881459) internal successors, (438), 332 states have internal predecessors, (438), 65 states have call successors, (65), 47 states have call predecessors, (65), 43 states have return successors, (61), 59 states have call predecessors, (61), 59 states have call successors, (61) [2021-11-16 22:48:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 564 transitions. [2021-11-16 22:48:35,182 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 564 transitions. Word has length 46 [2021-11-16 22:48:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:48:35,182 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 564 transitions. [2021-11-16 22:48:35,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-16 22:48:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 564 transitions. [2021-11-16 22:48:35,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-16 22:48:35,183 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:48:35,183 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-16 22:48:35,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-16 22:48:35,184 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:48:35,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:48:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash -554482790, now seen corresponding path program 1 times [2021-11-16 22:48:35,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:48:35,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563943211] [2021-11-16 22:48:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:48:35,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:48:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:35,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:48:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 22:48:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:35,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-16 22:48:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 22:48:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:35,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 22:48:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:35,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 22:48:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-16 22:48:35,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:48:35,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563943211] [2021-11-16 22:48:35,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563943211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:48:35,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:48:35,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 22:48:35,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326113693] [2021-11-16 22:48:35,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:48:35,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:48:35,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:48:35,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:48:35,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:48:35,801 INFO L87 Difference]: Start difference. First operand 438 states and 564 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-16 22:48:38,034 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:41,110 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:43,283 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:48:43,712 INFO L93 Difference]: Finished difference Result 873 states and 1126 transitions. [2021-11-16 22:48:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 22:48:43,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2021-11-16 22:48:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:48:43,715 INFO L225 Difference]: With dead ends: 873 [2021-11-16 22:48:43,715 INFO L226 Difference]: Without dead ends: 438 [2021-11-16 22:48:43,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:48:43,716 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 304 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 59 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:48:43,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 855 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 782 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2021-11-16 22:48:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-11-16 22:48:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2021-11-16 22:48:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 329 states have (on average 1.3282674772036474) internal successors, (437), 332 states have internal predecessors, (437), 65 states have call successors, (65), 47 states have call predecessors, (65), 43 states have return successors, (61), 59 states have call predecessors, (61), 59 states have call successors, (61) [2021-11-16 22:48:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 563 transitions. [2021-11-16 22:48:43,732 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 563 transitions. Word has length 50 [2021-11-16 22:48:43,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:48:43,732 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 563 transitions. [2021-11-16 22:48:43,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-16 22:48:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 563 transitions. [2021-11-16 22:48:43,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-16 22:48:43,734 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:48:43,734 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-16 22:48:43,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-16 22:48:43,734 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:48:43,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:48:43,735 INFO L85 PathProgramCache]: Analyzing trace with hash -207118685, now seen corresponding path program 1 times [2021-11-16 22:48:43,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:48:43,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145686116] [2021-11-16 22:48:43,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:48:43,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:48:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:44,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:48:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:44,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 22:48:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:48:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 22:48:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:44,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 22:48:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:44,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 22:48:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:48:44,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:48:44,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145686116] [2021-11-16 22:48:44,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145686116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:48:44,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:48:44,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:48:44,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087243867] [2021-11-16 22:48:44,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:48:44,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:48:44,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:48:44,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:48:44,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:48:44,450 INFO L87 Difference]: Start difference. First operand 438 states and 563 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-16 22:48:46,728 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:48,896 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:51,626 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:51,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:48:51,984 INFO L93 Difference]: Finished difference Result 440 states and 564 transitions. [2021-11-16 22:48:51,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 22:48:51,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2021-11-16 22:48:51,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:48:51,986 INFO L225 Difference]: With dead ends: 440 [2021-11-16 22:48:51,986 INFO L226 Difference]: Without dead ends: 437 [2021-11-16 22:48:51,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:48:51,987 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 593 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 128 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2021-11-16 22:48:51,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 580 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 464 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2021-11-16 22:48:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-16 22:48:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2021-11-16 22:48:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 329 states have (on average 1.325227963525836) internal successors, (436), 331 states have internal predecessors, (436), 64 states have call successors, (64), 47 states have call predecessors, (64), 43 states have return successors, (61), 59 states have call predecessors, (61), 59 states have call successors, (61) [2021-11-16 22:48:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 561 transitions. [2021-11-16 22:48:52,025 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 561 transitions. Word has length 51 [2021-11-16 22:48:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:48:52,026 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 561 transitions. [2021-11-16 22:48:52,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-16 22:48:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 561 transitions. [2021-11-16 22:48:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-16 22:48:52,027 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:48:52,027 INFO L514 BasicCegarLoop]: 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] [2021-11-16 22:48:52,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-16 22:48:52,027 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:48:52,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:48:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1616854617, now seen corresponding path program 1 times [2021-11-16 22:48:52,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:48:52,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552481345] [2021-11-16 22:48:52,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:48:52,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:48:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:48:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 22:48:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 22:48:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 22:48:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-16 22:48:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:48:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-16 22:48:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:48:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 22:48:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 22:48:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:48:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-16 22:48:52,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:48:52,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552481345] [2021-11-16 22:48:52,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552481345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:48:52,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:48:52,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 22:48:52,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980235455] [2021-11-16 22:48:52,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:48:52,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 22:48:52,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:48:52,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 22:48:52,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:48:52,786 INFO L87 Difference]: Start difference. First operand 437 states and 561 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-16 22:48:55,030 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:57,240 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:59,494 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:49:00,286 INFO L93 Difference]: Finished difference Result 691 states and 896 transitions. [2021-11-16 22:49:00,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 22:49:00,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76 [2021-11-16 22:49:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:49:00,289 INFO L225 Difference]: With dead ends: 691 [2021-11-16 22:49:00,289 INFO L226 Difference]: Without dead ends: 397 [2021-11-16 22:49:00,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-16 22:49:00,290 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 1402 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 348 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2021-11-16 22:49:00,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1403 Valid, 606 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 259 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2021-11-16 22:49:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-11-16 22:49:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 377. [2021-11-16 22:49:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 289 states have (on average 1.3321799307958477) internal successors, (385), 290 states have internal predecessors, (385), 51 states have call successors, (51), 39 states have call predecessors, (51), 36 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-11-16 22:49:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 484 transitions. [2021-11-16 22:49:00,305 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 484 transitions. Word has length 76 [2021-11-16 22:49:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:49:00,306 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 484 transitions. [2021-11-16 22:49:00,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-16 22:49:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 484 transitions. [2021-11-16 22:49:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-16 22:49:00,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:49:00,308 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:49:00,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-16 22:49:00,308 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:49:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:49:00,309 INFO L85 PathProgramCache]: Analyzing trace with hash 6958912, now seen corresponding path program 1 times [2021-11-16 22:49:00,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:49:00,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389934379] [2021-11-16 22:49:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:49:00,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:49:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:49:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:00,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 22:49:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:00,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 22:49:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 22:49:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-16 22:49:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:49:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-16 22:49:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 22:49:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:49:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 22:49:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 22:49:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-16 22:49:01,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:49:01,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389934379] [2021-11-16 22:49:01,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389934379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:49:01,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:49:01,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 22:49:01,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441098483] [2021-11-16 22:49:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:49:01,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 22:49:01,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:49:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 22:49:01,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:49:01,114 INFO L87 Difference]: Start difference. First operand 377 states and 484 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-16 22:49:03,375 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:05,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:07,840 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:10,041 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:49:11,076 INFO L93 Difference]: Finished difference Result 774 states and 996 transitions. [2021-11-16 22:49:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 22:49:11,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2021-11-16 22:49:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:49:11,078 INFO L225 Difference]: With dead ends: 774 [2021-11-16 22:49:11,078 INFO L226 Difference]: Without dead ends: 403 [2021-11-16 22:49:11,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-16 22:49:11,079 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 967 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 185 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:49:11,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [968 Valid, 954 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 453 Invalid, 4 Unknown, 0 Unchecked, 9.8s Time] [2021-11-16 22:49:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-16 22:49:11,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 377. [2021-11-16 22:49:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 289 states have (on average 1.3252595155709344) internal successors, (383), 290 states have internal predecessors, (383), 51 states have call successors, (51), 39 states have call predecessors, (51), 36 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-11-16 22:49:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 482 transitions. [2021-11-16 22:49:11,095 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 482 transitions. Word has length 116 [2021-11-16 22:49:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:49:11,095 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 482 transitions. [2021-11-16 22:49:11,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-16 22:49:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 482 transitions. [2021-11-16 22:49:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-16 22:49:11,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:49:11,101 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:49:11,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-16 22:49:11,101 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:49:11,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:49:11,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1186486857, now seen corresponding path program 1 times [2021-11-16 22:49:11,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:49:11,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005102565] [2021-11-16 22:49:11,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:49:11,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:49:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:49:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 22:49:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 22:49:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 22:49:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-16 22:49:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:49:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-16 22:49:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 22:49:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:49:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 22:49:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 22:49:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-16 22:49:11,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:49:11,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005102565] [2021-11-16 22:49:11,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005102565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:49:11,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:49:11,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 22:49:11,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492874483] [2021-11-16 22:49:11,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:49:11,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 22:49:11,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:49:11,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 22:49:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-16 22:49:11,946 INFO L87 Difference]: Start difference. First operand 377 states and 482 transitions. Second operand has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-16 22:49:14,172 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:16,261 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:19,821 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:21,818 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:49:22,273 INFO L93 Difference]: Finished difference Result 794 states and 1022 transitions. [2021-11-16 22:49:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 22:49:22,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2021-11-16 22:49:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:49:22,275 INFO L225 Difference]: With dead ends: 794 [2021-11-16 22:49:22,275 INFO L226 Difference]: Without dead ends: 423 [2021-11-16 22:49:22,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-11-16 22:49:22,277 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 965 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 250 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2021-11-16 22:49:22,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [968 Valid, 1024 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1141 Invalid, 3 Unknown, 0 Unchecked, 10.0s Time] [2021-11-16 22:49:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-11-16 22:49:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 380. [2021-11-16 22:49:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 291 states have (on average 1.3264604810996563) internal successors, (386), 293 states have internal predecessors, (386), 51 states have call successors, (51), 39 states have call predecessors, (51), 37 states have return successors, (49), 48 states have call predecessors, (49), 48 states have call successors, (49) [2021-11-16 22:49:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 486 transitions. [2021-11-16 22:49:22,293 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 486 transitions. Word has length 119 [2021-11-16 22:49:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:49:22,293 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 486 transitions. [2021-11-16 22:49:22,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-16 22:49:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 486 transitions. [2021-11-16 22:49:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-16 22:49:22,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:49:22,295 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:49:22,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-16 22:49:22,295 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:49:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:49:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash -93376821, now seen corresponding path program 1 times [2021-11-16 22:49:22,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:49:22,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894602776] [2021-11-16 22:49:22,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:49:22,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:49:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:49:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 22:49:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 22:49:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 22:49:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-16 22:49:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:49:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-16 22:49:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 22:49:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:49:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 22:49:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 22:49:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-16 22:49:23,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:49:23,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894602776] [2021-11-16 22:49:23,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894602776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:49:23,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:49:23,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 22:49:23,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166021953] [2021-11-16 22:49:23,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:49:23,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 22:49:23,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:49:23,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 22:49:23,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-16 22:49:23,136 INFO L87 Difference]: Start difference. First operand 380 states and 486 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-16 22:49:25,344 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:27,556 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:29,730 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:31,925 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:35,132 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:37,615 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:39,791 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:49:40,030 INFO L93 Difference]: Finished difference Result 887 states and 1168 transitions. [2021-11-16 22:49:40,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 22:49:40,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2021-11-16 22:49:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:49:40,032 INFO L225 Difference]: With dead ends: 887 [2021-11-16 22:49:40,032 INFO L226 Difference]: Without dead ends: 513 [2021-11-16 22:49:40,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-11-16 22:49:40,033 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 1564 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 326 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2021-11-16 22:49:40,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1566 Valid, 859 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 877 Invalid, 7 Unknown, 0 Unchecked, 16.7s Time] [2021-11-16 22:49:40,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-11-16 22:49:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 384. [2021-11-16 22:49:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 295 states have (on average 1.3220338983050848) internal successors, (390), 297 states have internal predecessors, (390), 51 states have call successors, (51), 39 states have call predecessors, (51), 37 states have return successors, (49), 48 states have call predecessors, (49), 48 states have call successors, (49) [2021-11-16 22:49:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 490 transitions. [2021-11-16 22:49:40,051 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 490 transitions. Word has length 119 [2021-11-16 22:49:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:49:40,052 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 490 transitions. [2021-11-16 22:49:40,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-16 22:49:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 490 transitions. [2021-11-16 22:49:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-16 22:49:40,054 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:49:40,054 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:49:40,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-16 22:49:40,054 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:49:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:49:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash 984416011, now seen corresponding path program 1 times [2021-11-16 22:49:40,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:49:40,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117123929] [2021-11-16 22:49:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:49:40,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:49:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:49:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 22:49:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 22:49:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 22:49:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-16 22:49:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:49:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-16 22:49:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 22:49:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:49:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 22:49:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 22:49:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-16 22:49:40,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:49:40,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117123929] [2021-11-16 22:49:40,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117123929] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:49:40,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:49:40,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 22:49:40,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70194196] [2021-11-16 22:49:40,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:49:40,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 22:49:40,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:49:40,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 22:49:40,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-16 22:49:40,984 INFO L87 Difference]: Start difference. First operand 384 states and 490 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-16 22:49:43,213 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:45,284 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:47,472 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:49,685 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:52,878 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:54,843 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:49:55,360 INFO L93 Difference]: Finished difference Result 447 states and 588 transitions. [2021-11-16 22:49:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-16 22:49:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 119 [2021-11-16 22:49:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:49:55,362 INFO L225 Difference]: With dead ends: 447 [2021-11-16 22:49:55,362 INFO L226 Difference]: Without dead ends: 439 [2021-11-16 22:49:55,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-11-16 22:49:55,363 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 806 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 201 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2021-11-16 22:49:55,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [811 Valid, 1094 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 974 Invalid, 5 Unknown, 0 Unchecked, 14.0s Time] [2021-11-16 22:49:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-11-16 22:49:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 390. [2021-11-16 22:49:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 300 states have (on average 1.32) internal successors, (396), 302 states have internal predecessors, (396), 51 states have call successors, (51), 39 states have call predecessors, (51), 38 states have return successors, (51), 49 states have call predecessors, (51), 48 states have call successors, (51) [2021-11-16 22:49:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 498 transitions. [2021-11-16 22:49:55,388 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 498 transitions. Word has length 119 [2021-11-16 22:49:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:49:55,388 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 498 transitions. [2021-11-16 22:49:55,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-16 22:49:55,389 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 498 transitions. [2021-11-16 22:49:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-16 22:49:55,390 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:49:55,390 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:49:55,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-16 22:49:55,390 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:49:55,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:49:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash 478857386, now seen corresponding path program 1 times [2021-11-16 22:49:55,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:49:55,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132987525] [2021-11-16 22:49:55,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:49:55,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms Killed by 15