./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a45fd6cc499457b8646fc297298cfc21cc57c7198001d9ae53614774c0beef98 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 02:11:42,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 02:11:42,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 02:11:42,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 02:11:42,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 02:11:42,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 02:11:42,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 02:11:42,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 02:11:42,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 02:11:42,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 02:11:42,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 02:11:42,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 02:11:42,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 02:11:42,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 02:11:42,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 02:11:42,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 02:11:42,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 02:11:42,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 02:11:42,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 02:11:42,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 02:11:42,896 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 02:11:42,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 02:11:42,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 02:11:42,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 02:11:42,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 02:11:42,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 02:11:42,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 02:11:42,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 02:11:42,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 02:11:42,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 02:11:42,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 02:11:42,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 02:11:42,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 02:11:42,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 02:11:42,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 02:11:42,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 02:11:42,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 02:11:42,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 02:11:42,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 02:11:42,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 02:11:42,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 02:11:42,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 02:11:42,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 02:11:42,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 02:11:42,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 02:11:42,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 02:11:42,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 02:11:42,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 02:11:42,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 02:11:42,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 02:11:42,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 02:11:42,950 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 02:11:42,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 02:11:42,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 02:11:42,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 02:11:42,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 02:11:42,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 02:11:42,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 02:11:42,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 02:11:42,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 02:11:42,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 02:11:42,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 02:11:42,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 02:11:42,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 02:11:42,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 02:11:42,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 02:11:42,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 02:11:42,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 02:11:42,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 02:11:42,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 02:11:42,954 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 02:11:42,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 02:11:42,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 02:11:42,955 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 -> a45fd6cc499457b8646fc297298cfc21cc57c7198001d9ae53614774c0beef98 [2022-07-14 02:11:43,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 02:11:43,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 02:11:43,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 02:11:43,226 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 02:11:43,227 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 02:11:43,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-14 02:11:43,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af534d14/71e25720615a45f9b090bf62c60f2423/FLAGe355ec274 [2022-07-14 02:11:44,060 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 02:11:44,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-14 02:11:44,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af534d14/71e25720615a45f9b090bf62c60f2423/FLAGe355ec274 [2022-07-14 02:11:44,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af534d14/71e25720615a45f9b090bf62c60f2423 [2022-07-14 02:11:44,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 02:11:44,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 02:11:44,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 02:11:44,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 02:11:44,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 02:11:44,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:11:44" (1/1) ... [2022-07-14 02:11:44,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552908dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:44, skipping insertion in model container [2022-07-14 02:11:44,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:11:44" (1/1) ... [2022-07-14 02:11:44,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 02:11:44,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 02:11:46,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i[318493,318506] [2022-07-14 02:11:46,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 02:11:46,369 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 02:11:46,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i[318493,318506] [2022-07-14 02:11:46,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 02:11:46,825 INFO L208 MainTranslator]: Completed translation [2022-07-14 02:11:46,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46 WrapperNode [2022-07-14 02:11:46,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 02:11:46,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 02:11:46,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 02:11:46,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 02:11:46,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (1/1) ... [2022-07-14 02:11:46,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (1/1) ... [2022-07-14 02:11:47,122 INFO L137 Inliner]: procedures = 311, calls = 1623, calls flagged for inlining = 133, calls inlined = 130, statements flattened = 4354 [2022-07-14 02:11:47,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 02:11:47,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 02:11:47,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 02:11:47,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 02:11:47,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (1/1) ... [2022-07-14 02:11:47,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (1/1) ... [2022-07-14 02:11:47,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (1/1) ... [2022-07-14 02:11:47,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (1/1) ... [2022-07-14 02:11:47,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (1/1) ... [2022-07-14 02:11:47,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (1/1) ... [2022-07-14 02:11:47,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (1/1) ... [2022-07-14 02:11:47,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 02:11:47,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 02:11:47,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 02:11:47,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 02:11:47,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (1/1) ... [2022-07-14 02:11:47,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 02:11:47,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 02:11:47,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 02:11:47,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 02:11:47,455 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-14 02:11:47,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-14 02:11:47,456 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_cpu_to_dev32 [2022-07-14 02:11:47,456 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_cpu_to_dev32 [2022-07-14 02:11:47,456 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-14 02:11:47,456 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-14 02:11:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure put_rx_struct [2022-07-14 02:11:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure put_rx_struct [2022-07-14 02:11:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 02:11:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 02:11:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_netif_rx [2022-07-14 02:11:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_netif_rx [2022-07-14 02:11:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 02:11:47,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 02:11:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 02:11:47,458 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 02:11:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-07-14 02:11:47,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-07-14 02:11:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 02:11:47,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 02:11:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-07-14 02:11:47,459 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-07-14 02:11:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2022-07-14 02:11:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2022-07-14 02:11:47,459 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2022-07-14 02:11:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_cpu_to_dev16 [2022-07-14 02:11:47,460 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_cpu_to_dev16 [2022-07-14 02:11:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_dev16_to_cpu [2022-07-14 02:11:47,460 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_dev16_to_cpu [2022-07-14 02:11:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_stats [2022-07-14 02:11:47,460 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_stats [2022-07-14 02:11:47,461 INFO L130 BoogieDeclarations]: Found specification of procedure free_rx_struct [2022-07-14 02:11:47,461 INFO L138 BoogieDeclarations]: Found implementation of procedure free_rx_struct [2022-07-14 02:11:47,461 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-14 02:11:47,461 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-14 02:11:47,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 02:11:47,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 02:11:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 02:11:47,462 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 02:11:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 02:11:47,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 02:11:47,463 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-14 02:11:47,463 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-14 02:11:47,463 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-14 02:11:47,463 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-14 02:11:47,463 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_set_config [2022-07-14 02:11:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_set_config [2022-07-14 02:11:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_set_endian [2022-07-14 02:11:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_set_endian [2022-07-14 02:11:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-14 02:11:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-14 02:11:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 02:11:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-14 02:11:47,465 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-14 02:11:47,465 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-14 02:11:47,466 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_resume [2022-07-14 02:11:47,466 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_resume [2022-07-14 02:11:47,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 02:11:47,466 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_rx [2022-07-14 02:11:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_rx [2022-07-14 02:11:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure free_tx_sdu_struct [2022-07-14 02:11:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tx_sdu_struct [2022-07-14 02:11:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2022-07-14 02:11:47,468 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2022-07-14 02:11:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-14 02:11:47,468 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-14 02:11:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 02:11:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 02:11:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-14 02:11:47,469 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-14 02:11:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2022-07-14 02:11:47,469 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2022-07-14 02:11:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-14 02:11:47,470 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-14 02:11:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-14 02:11:47,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-14 02:11:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 02:11:47,470 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 02:11:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-14 02:11:47,471 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-14 02:11:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-14 02:11:47,471 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-14 02:11:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure packet_aggregation [2022-07-14 02:11:47,471 INFO L138 BoogieDeclarations]: Found implementation of procedure packet_aggregation [2022-07-14 02:11:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_tx_struct [2022-07-14 02:11:47,471 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_tx_struct [2022-07-14 02:11:47,472 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-07-14 02:11:47,472 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-07-14 02:11:47,472 INFO L130 BoogieDeclarations]: Found specification of procedure find_dev_index [2022-07-14 02:11:47,472 INFO L138 BoogieDeclarations]: Found implementation of procedure find_dev_index [2022-07-14 02:11:47,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 02:11:47,473 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-14 02:11:47,473 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-14 02:11:47,473 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-14 02:11:47,474 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-14 02:11:47,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 02:11:47,474 INFO L130 BoogieDeclarations]: Found specification of procedure do_tx [2022-07-14 02:11:47,474 INFO L138 BoogieDeclarations]: Found implementation of procedure do_tx [2022-07-14 02:11:47,474 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-14 02:11:47,475 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-14 02:11:47,475 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mark_last_busy [2022-07-14 02:11:47,475 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mark_last_busy [2022-07-14 02:11:47,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 02:11:47,476 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_has_listeners [2022-07-14 02:11:47,476 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_has_listeners [2022-07-14 02:11:47,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 02:11:47,476 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 02:11:47,476 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-14 02:11:47,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-14 02:11:47,477 INFO L130 BoogieDeclarations]: Found specification of procedure ether_addr_copy [2022-07-14 02:11:47,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ether_addr_copy [2022-07-14 02:11:47,477 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-14 02:11:47,478 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-14 02:11:47,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 02:11:47,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 02:11:47,478 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_send_complete [2022-07-14 02:11:47,478 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_send_complete [2022-07-14 02:11:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 02:11:47,479 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 02:11:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure ether_setup [2022-07-14 02:11:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-14 02:11:47,481 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-14 02:11:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 02:11:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-14 02:11:47,484 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-14 02:11:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-14 02:11:47,484 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-14 02:11:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-14 02:11:47,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-14 02:11:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_disconnect [2022-07-14 02:11:47,501 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_disconnect [2022-07-14 02:11:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 02:11:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-14 02:11:47,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-14 02:11:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 02:11:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_recv [2022-07-14 02:11:47,502 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_recv [2022-07-14 02:11:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 02:11:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-14 02:11:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 02:11:47,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 02:11:47,503 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_lte_device [2022-07-14 02:11:47,503 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_lte_device [2022-07-14 02:11:47,503 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-14 02:11:47,503 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-14 02:11:47,503 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-14 02:11:47,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-14 02:11:47,504 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-14 02:11:47,504 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-14 02:11:47,504 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2022-07-14 02:11:47,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2022-07-14 02:11:47,504 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2022-07-14 02:11:47,504 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2022-07-14 02:11:47,504 INFO L130 BoogieDeclarations]: Found specification of procedure free_tx_struct [2022-07-14 02:11:47,505 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tx_struct [2022-07-14 02:11:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-07-14 02:11:47,505 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-07-14 02:11:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-14 02:11:47,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-14 02:11:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_dev32_to_cpu [2022-07-14 02:11:47,505 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_dev32_to_cpu [2022-07-14 02:11:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-14 02:11:47,506 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-14 02:11:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure do_rx [2022-07-14 02:11:47,506 INFO L138 BoogieDeclarations]: Found implementation of procedure do_rx [2022-07-14 02:11:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 02:11:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-14 02:11:47,506 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-14 02:11:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure release_usb [2022-07-14 02:11:47,507 INFO L138 BoogieDeclarations]: Found implementation of procedure release_usb [2022-07-14 02:11:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-07-14 02:11:47,507 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-07-14 02:11:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-14 02:11:47,507 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-14 02:11:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 02:11:47,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 02:11:48,320 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 02:11:48,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 02:11:48,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 02:11:51,154 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 02:11:51,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 02:11:51,178 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 02:11:51,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:11:51 BoogieIcfgContainer [2022-07-14 02:11:51,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 02:11:51,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 02:11:51,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 02:11:51,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 02:11:51,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 02:11:44" (1/3) ... [2022-07-14 02:11:51,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101d9570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 02:11:51, skipping insertion in model container [2022-07-14 02:11:51,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:11:46" (2/3) ... [2022-07-14 02:11:51,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101d9570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 02:11:51, skipping insertion in model container [2022-07-14 02:11:51,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:11:51" (3/3) ... [2022-07-14 02:11:51,192 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-14 02:11:51,205 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 02:11:51,206 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 02:11:51,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 02:11:51,308 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64838788, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ea4758a [2022-07-14 02:11:51,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 02:11:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 1526 states, 1043 states have (on average 1.3883029721955897) internal successors, (1448), 1083 states have internal predecessors, (1448), 404 states have call successors, (404), 78 states have call predecessors, (404), 77 states have return successors, (398), 388 states have call predecessors, (398), 398 states have call successors, (398) [2022-07-14 02:11:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 02:11:51,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:11:51,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:11:51,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:11:51,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:11:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash 537382679, now seen corresponding path program 1 times [2022-07-14 02:11:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:11:51,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200262550] [2022-07-14 02:11:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:11:51,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:11:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:11:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:51,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:11:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:11:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:51,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:11:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:11:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 02:11:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:11:51,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200262550] [2022-07-14 02:11:51,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200262550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:11:51,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:11:51,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 02:11:51,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30628031] [2022-07-14 02:11:51,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:11:51,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 02:11:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:11:52,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 02:11:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 02:11:52,032 INFO L87 Difference]: Start difference. First operand has 1526 states, 1043 states have (on average 1.3883029721955897) internal successors, (1448), 1083 states have internal predecessors, (1448), 404 states have call successors, (404), 78 states have call predecessors, (404), 77 states have return successors, (398), 388 states have call predecessors, (398), 398 states have call successors, (398) Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 02:11:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:11:55,759 INFO L93 Difference]: Finished difference Result 3355 states and 5176 transitions. [2022-07-14 02:11:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 02:11:55,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-07-14 02:11:55,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:11:55,790 INFO L225 Difference]: With dead ends: 3355 [2022-07-14 02:11:55,790 INFO L226 Difference]: Without dead ends: 1818 [2022-07-14 02:11:55,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:11:55,806 INFO L413 NwaCegarLoop]: 2136 mSDtfsCounter, 1032 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 1161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-14 02:11:55,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 4146 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-14 02:11:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2022-07-14 02:11:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1510. [2022-07-14 02:11:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1035 states have (on average 1.3371980676328503) internal successors, (1384), 1068 states have internal predecessors, (1384), 398 states have call successors, (398), 77 states have call predecessors, (398), 76 states have return successors, (396), 386 states have call predecessors, (396), 396 states have call successors, (396) [2022-07-14 02:11:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2178 transitions. [2022-07-14 02:11:55,980 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2178 transitions. Word has length 49 [2022-07-14 02:11:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:11:55,980 INFO L495 AbstractCegarLoop]: Abstraction has 1510 states and 2178 transitions. [2022-07-14 02:11:55,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 02:11:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2178 transitions. [2022-07-14 02:11:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 02:11:55,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:11:55,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:11:55,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 02:11:55,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:11:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:11:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash -491976619, now seen corresponding path program 1 times [2022-07-14 02:11:55,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:11:55,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022112322] [2022-07-14 02:11:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:11:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:11:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:11:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:11:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:11:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:56,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:11:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:11:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:11:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 02:11:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:11:56,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022112322] [2022-07-14 02:11:56,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022112322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:11:56,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:11:56,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:11:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774991345] [2022-07-14 02:11:56,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:11:56,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:11:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:11:56,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:11:56,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:11:56,271 INFO L87 Difference]: Start difference. First operand 1510 states and 2178 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 02:12:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:12:01,557 INFO L93 Difference]: Finished difference Result 4855 states and 7262 transitions. [2022-07-14 02:12:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:12:01,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-07-14 02:12:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:12:01,582 INFO L225 Difference]: With dead ends: 4855 [2022-07-14 02:12:01,582 INFO L226 Difference]: Without dead ends: 3355 [2022-07-14 02:12:01,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-14 02:12:01,592 INFO L413 NwaCegarLoop]: 2636 mSDtfsCounter, 4548 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 2208 mSolverCounterSat, 3364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4813 SdHoareTripleChecker+Valid, 5313 SdHoareTripleChecker+Invalid, 5572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3364 IncrementalHoareTripleChecker+Valid, 2208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-14 02:12:01,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4813 Valid, 5313 Invalid, 5572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3364 Valid, 2208 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-14 02:12:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-07-14 02:12:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2745. [2022-07-14 02:12:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 1895 states have (on average 1.341424802110818) internal successors, (2542), 1952 states have internal predecessors, (2542), 710 states have call successors, (710), 140 states have call predecessors, (710), 139 states have return successors, (708), 689 states have call predecessors, (708), 708 states have call successors, (708) [2022-07-14 02:12:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3960 transitions. [2022-07-14 02:12:01,764 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3960 transitions. Word has length 49 [2022-07-14 02:12:01,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:12:01,764 INFO L495 AbstractCegarLoop]: Abstraction has 2745 states and 3960 transitions. [2022-07-14 02:12:01,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 02:12:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3960 transitions. [2022-07-14 02:12:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-14 02:12:01,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:12:01,772 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:12:01,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 02:12:01,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:12:01,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:12:01,773 INFO L85 PathProgramCache]: Analyzing trace with hash -305469456, now seen corresponding path program 1 times [2022-07-14 02:12:01,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:12:01,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438757135] [2022-07-14 02:12:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:12:01,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:12:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:01,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:12:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:01,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:02,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:12:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 02:12:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:02,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 02:12:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 02:12:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 02:12:02,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:12:02,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438757135] [2022-07-14 02:12:02,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438757135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:12:02,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:12:02,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 02:12:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233938581] [2022-07-14 02:12:02,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:12:02,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 02:12:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:12:02,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 02:12:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 02:12:02,052 INFO L87 Difference]: Start difference. First operand 2745 states and 3960 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 02:12:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:12:10,681 INFO L93 Difference]: Finished difference Result 9823 states and 14952 transitions. [2022-07-14 02:12:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 02:12:10,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-07-14 02:12:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:12:10,726 INFO L225 Difference]: With dead ends: 9823 [2022-07-14 02:12:10,726 INFO L226 Difference]: Without dead ends: 7088 [2022-07-14 02:12:10,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-14 02:12:10,739 INFO L413 NwaCegarLoop]: 2188 mSDtfsCounter, 5702 mSDsluCounter, 4681 mSDsCounter, 0 mSdLazyCounter, 5464 mSolverCounterSat, 4291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6077 SdHoareTripleChecker+Valid, 6869 SdHoareTripleChecker+Invalid, 9755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4291 IncrementalHoareTripleChecker+Valid, 5464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-14 02:12:10,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6077 Valid, 6869 Invalid, 9755 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4291 Valid, 5464 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-07-14 02:12:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2022-07-14 02:12:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5665. [2022-07-14 02:12:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 3946 states have (on average 1.3563101875316776) internal successors, (5352), 4067 states have internal predecessors, (5352), 1427 states have call successors, (1427), 279 states have call predecessors, (1427), 291 states have return successors, (1511), 1395 states have call predecessors, (1511), 1424 states have call successors, (1511) [2022-07-14 02:12:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 8290 transitions. [2022-07-14 02:12:11,024 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 8290 transitions. Word has length 69 [2022-07-14 02:12:11,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:12:11,025 INFO L495 AbstractCegarLoop]: Abstraction has 5665 states and 8290 transitions. [2022-07-14 02:12:11,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 02:12:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 8290 transitions. [2022-07-14 02:12:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-14 02:12:11,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:12:11,028 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:12:11,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 02:12:11,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:12:11,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:12:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1392904398, now seen corresponding path program 1 times [2022-07-14 02:12:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:12:11,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74050086] [2022-07-14 02:12:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:12:11,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:12:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:11,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:12:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:11,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:12:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:11,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 02:12:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:11,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 02:12:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:11,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 02:12:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 02:12:11,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:12:11,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74050086] [2022-07-14 02:12:11,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74050086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:12:11,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:12:11,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 02:12:11,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216885487] [2022-07-14 02:12:11,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:12:11,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 02:12:11,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:12:11,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 02:12:11,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 02:12:11,342 INFO L87 Difference]: Start difference. First operand 5665 states and 8290 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 02:12:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:12:18,252 INFO L93 Difference]: Finished difference Result 16076 states and 24448 transitions. [2022-07-14 02:12:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 02:12:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-07-14 02:12:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:12:18,314 INFO L225 Difference]: With dead ends: 16076 [2022-07-14 02:12:18,314 INFO L226 Difference]: Without dead ends: 10421 [2022-07-14 02:12:18,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-14 02:12:18,340 INFO L413 NwaCegarLoop]: 2167 mSDtfsCounter, 6187 mSDsluCounter, 3665 mSDsCounter, 0 mSdLazyCounter, 4436 mSolverCounterSat, 4460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6557 SdHoareTripleChecker+Valid, 5832 SdHoareTripleChecker+Invalid, 8896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4460 IncrementalHoareTripleChecker+Valid, 4436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-14 02:12:18,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6557 Valid, 5832 Invalid, 8896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4460 Valid, 4436 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-07-14 02:12:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10421 states. [2022-07-14 02:12:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10421 to 8539. [2022-07-14 02:12:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8539 states, 5967 states have (on average 1.3616557734204793) internal successors, (8125), 6156 states have internal predecessors, (8125), 2132 states have call successors, (2132), 418 states have call predecessors, (2132), 439 states have return successors, (2313), 2079 states have call predecessors, (2313), 2128 states have call successors, (2313) [2022-07-14 02:12:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8539 states to 8539 states and 12570 transitions. [2022-07-14 02:12:18,843 INFO L78 Accepts]: Start accepts. Automaton has 8539 states and 12570 transitions. Word has length 68 [2022-07-14 02:12:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:12:18,845 INFO L495 AbstractCegarLoop]: Abstraction has 8539 states and 12570 transitions. [2022-07-14 02:12:18,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 02:12:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 8539 states and 12570 transitions. [2022-07-14 02:12:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 02:12:18,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:12:18,849 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:12:18,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 02:12:18,849 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:12:18,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:12:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1859013993, now seen corresponding path program 1 times [2022-07-14 02:12:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:12:18,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744233349] [2022-07-14 02:12:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:12:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:12:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:12:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:19,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:12:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:19,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 02:12:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 02:12:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:19,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 02:12:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 02:12:19,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:12:19,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744233349] [2022-07-14 02:12:19,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744233349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:12:19,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:12:19,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 02:12:19,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998658205] [2022-07-14 02:12:19,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:12:19,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 02:12:19,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:12:19,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 02:12:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 02:12:19,055 INFO L87 Difference]: Start difference. First operand 8539 states and 12570 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 02:12:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:12:26,652 INFO L93 Difference]: Finished difference Result 22466 states and 34338 transitions. [2022-07-14 02:12:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 02:12:26,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-07-14 02:12:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:12:26,732 INFO L225 Difference]: With dead ends: 22466 [2022-07-14 02:12:26,732 INFO L226 Difference]: Without dead ends: 13937 [2022-07-14 02:12:26,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-14 02:12:26,767 INFO L413 NwaCegarLoop]: 2298 mSDtfsCounter, 5463 mSDsluCounter, 4645 mSDsCounter, 0 mSdLazyCounter, 5420 mSolverCounterSat, 4305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5837 SdHoareTripleChecker+Valid, 6943 SdHoareTripleChecker+Invalid, 9725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4305 IncrementalHoareTripleChecker+Valid, 5420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-14 02:12:26,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5837 Valid, 6943 Invalid, 9725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4305 Valid, 5420 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-14 02:12:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13937 states. [2022-07-14 02:12:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13937 to 11447. [2022-07-14 02:12:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11447 states, 8012 states have (on average 1.3635796305541688) internal successors, (10925), 8267 states have internal predecessors, (10925), 2843 states have call successors, (2843), 557 states have call predecessors, (2843), 591 states have return successors, (3148), 2777 states have call predecessors, (3148), 2838 states have call successors, (3148) [2022-07-14 02:12:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11447 states to 11447 states and 16916 transitions. [2022-07-14 02:12:27,356 INFO L78 Accepts]: Start accepts. Automaton has 11447 states and 16916 transitions. Word has length 70 [2022-07-14 02:12:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:12:27,357 INFO L495 AbstractCegarLoop]: Abstraction has 11447 states and 16916 transitions. [2022-07-14 02:12:27,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 02:12:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 11447 states and 16916 transitions. [2022-07-14 02:12:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 02:12:27,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:12:27,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:12:27,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 02:12:27,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:12:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:12:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1077150297, now seen corresponding path program 1 times [2022-07-14 02:12:27,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:12:27,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692230920] [2022-07-14 02:12:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:12:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:12:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:27,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:12:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:27,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:27,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:27,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:12:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 02:12:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:27,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:12:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 02:12:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 02:12:27,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:12:27,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692230920] [2022-07-14 02:12:27,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692230920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:12:27,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:12:27,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 02:12:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523671825] [2022-07-14 02:12:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:12:27,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 02:12:27,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:12:27,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 02:12:27,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 02:12:27,557 INFO L87 Difference]: Start difference. First operand 11447 states and 16916 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 02:12:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:12:33,857 INFO L93 Difference]: Finished difference Result 27908 states and 42487 transitions. [2022-07-14 02:12:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 02:12:33,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-07-14 02:12:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:12:33,939 INFO L225 Difference]: With dead ends: 27908 [2022-07-14 02:12:33,940 INFO L226 Difference]: Without dead ends: 16427 [2022-07-14 02:12:33,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-14 02:12:33,982 INFO L413 NwaCegarLoop]: 2300 mSDtfsCounter, 6933 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 3579 mSolverCounterSat, 5644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7308 SdHoareTripleChecker+Valid, 5378 SdHoareTripleChecker+Invalid, 9223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5644 IncrementalHoareTripleChecker+Valid, 3579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-14 02:12:33,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7308 Valid, 5378 Invalid, 9223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5644 Valid, 3579 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-14 02:12:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16427 states. [2022-07-14 02:12:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16427 to 13502. [2022-07-14 02:12:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13502 states, 9434 states have (on average 1.3522365910536358) internal successors, (12757), 9706 states have internal predecessors, (12757), 3363 states have call successors, (3363), 669 states have call predecessors, (3363), 704 states have return successors, (3683), 3298 states have call predecessors, (3683), 3358 states have call successors, (3683) [2022-07-14 02:12:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13502 states to 13502 states and 19803 transitions. [2022-07-14 02:12:34,724 INFO L78 Accepts]: Start accepts. Automaton has 13502 states and 19803 transitions. Word has length 71 [2022-07-14 02:12:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:12:34,726 INFO L495 AbstractCegarLoop]: Abstraction has 13502 states and 19803 transitions. [2022-07-14 02:12:34,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 02:12:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13502 states and 19803 transitions. [2022-07-14 02:12:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-14 02:12:34,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:12:34,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:12:34,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 02:12:34,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:12:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:12:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1015390489, now seen corresponding path program 1 times [2022-07-14 02:12:34,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:12:34,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177437425] [2022-07-14 02:12:34,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:12:34,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:12:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:34,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:12:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:34,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:12:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 02:12:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:34,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:34,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:34,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:12:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 02:12:34,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:12:34,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177437425] [2022-07-14 02:12:34,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177437425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:12:34,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:12:34,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:12:34,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217656191] [2022-07-14 02:12:34,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:12:34,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:12:34,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:12:34,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:12:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:12:34,951 INFO L87 Difference]: Start difference. First operand 13502 states and 19803 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 02:12:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:12:37,901 INFO L93 Difference]: Finished difference Result 16802 states and 25517 transitions. [2022-07-14 02:12:37,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:12:37,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2022-07-14 02:12:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:12:37,988 INFO L225 Difference]: With dead ends: 16802 [2022-07-14 02:12:37,989 INFO L226 Difference]: Without dead ends: 16799 [2022-07-14 02:12:38,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-14 02:12:38,003 INFO L413 NwaCegarLoop]: 2136 mSDtfsCounter, 3466 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 2203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3678 SdHoareTripleChecker+Valid, 3398 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2203 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 02:12:38,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3678 Valid, 3398 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2203 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 02:12:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2022-07-14 02:12:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 13987. [2022-07-14 02:12:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13987 states, 9744 states have (on average 1.3473932676518883) internal successors, (13129), 10032 states have internal predecessors, (13129), 3467 states have call successors, (3467), 740 states have call predecessors, (3467), 775 states have return successors, (3787), 3402 states have call predecessors, (3787), 3462 states have call successors, (3787) [2022-07-14 02:12:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 20383 transitions. [2022-07-14 02:12:38,762 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 20383 transitions. Word has length 86 [2022-07-14 02:12:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:12:38,763 INFO L495 AbstractCegarLoop]: Abstraction has 13987 states and 20383 transitions. [2022-07-14 02:12:38,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 02:12:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 20383 transitions. [2022-07-14 02:12:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-14 02:12:38,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:12:38,777 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:12:38,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 02:12:38,777 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:12:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:12:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash -565835672, now seen corresponding path program 1 times [2022-07-14 02:12:38,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:12:38,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587979788] [2022-07-14 02:12:38,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:12:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:12:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:38,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:12:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:38,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:38,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:12:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:38,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 02:12:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:38,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:38,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 02:12:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 02:12:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 02:12:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 02:12:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 02:12:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 02:12:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 02:12:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 02:12:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 02:12:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-14 02:12:39,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:12:39,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587979788] [2022-07-14 02:12:39,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587979788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:12:39,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:12:39,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 02:12:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983412557] [2022-07-14 02:12:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:12:39,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 02:12:39,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:12:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 02:12:39,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-14 02:12:39,095 INFO L87 Difference]: Start difference. First operand 13987 states and 20383 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-14 02:12:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:12:49,588 INFO L93 Difference]: Finished difference Result 40146 states and 60650 transitions. [2022-07-14 02:12:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 02:12:49,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 173 [2022-07-14 02:12:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:12:49,694 INFO L225 Difference]: With dead ends: 40146 [2022-07-14 02:12:49,694 INFO L226 Difference]: Without dead ends: 26169 [2022-07-14 02:12:49,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-07-14 02:12:49,739 INFO L413 NwaCegarLoop]: 3307 mSDtfsCounter, 6184 mSDsluCounter, 5465 mSDsCounter, 0 mSdLazyCounter, 5116 mSolverCounterSat, 5914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6541 SdHoareTripleChecker+Valid, 8772 SdHoareTripleChecker+Invalid, 11030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5914 IncrementalHoareTripleChecker+Valid, 5116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-07-14 02:12:49,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6541 Valid, 8772 Invalid, 11030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5914 Valid, 5116 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-07-14 02:12:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26169 states. [2022-07-14 02:12:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26169 to 20775. [2022-07-14 02:12:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20775 states, 14493 states have (on average 1.3469951010832817) internal successors, (19522), 14905 states have internal predecessors, (19522), 5154 states have call successors, (5154), 1079 states have call predecessors, (5154), 1127 states have return successors, (5608), 5069 states have call predecessors, (5608), 5149 states have call successors, (5608) [2022-07-14 02:12:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20775 states to 20775 states and 30284 transitions. [2022-07-14 02:12:51,103 INFO L78 Accepts]: Start accepts. Automaton has 20775 states and 30284 transitions. Word has length 173 [2022-07-14 02:12:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:12:51,105 INFO L495 AbstractCegarLoop]: Abstraction has 20775 states and 30284 transitions. [2022-07-14 02:12:51,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-14 02:12:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 20775 states and 30284 transitions. [2022-07-14 02:12:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-14 02:12:51,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:12:51,120 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:12:51,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 02:12:51,120 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:12:51,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:12:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1506792216, now seen corresponding path program 1 times [2022-07-14 02:12:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:12:51,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916386575] [2022-07-14 02:12:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:12:51,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:12:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:12:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:12:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 02:12:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:12:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 02:12:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 02:12:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 02:12:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 02:12:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 02:12:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:12:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:12:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 02:12:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-14 02:12:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 02:12:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-14 02:12:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:12:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-14 02:12:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:12:51,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916386575] [2022-07-14 02:12:51,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916386575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:12:51,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:12:51,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 02:12:51,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701839883] [2022-07-14 02:12:51,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:12:51,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 02:12:51,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:12:51,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 02:12:51,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-14 02:12:51,438 INFO L87 Difference]: Start difference. First operand 20775 states and 30284 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 02:13:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:13:06,972 INFO L93 Difference]: Finished difference Result 61851 states and 93429 transitions. [2022-07-14 02:13:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 02:13:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 189 [2022-07-14 02:13:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:13:07,153 INFO L225 Difference]: With dead ends: 61851 [2022-07-14 02:13:07,154 INFO L226 Difference]: Without dead ends: 41086 [2022-07-14 02:13:07,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2022-07-14 02:13:07,233 INFO L413 NwaCegarLoop]: 2894 mSDtfsCounter, 6904 mSDsluCounter, 6575 mSDsCounter, 0 mSdLazyCounter, 9121 mSolverCounterSat, 6482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7112 SdHoareTripleChecker+Valid, 9469 SdHoareTripleChecker+Invalid, 15603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6482 IncrementalHoareTripleChecker+Valid, 9121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-07-14 02:13:07,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7112 Valid, 9469 Invalid, 15603 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6482 Valid, 9121 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2022-07-14 02:13:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41086 states. [2022-07-14 02:13:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41086 to 32211. [2022-07-14 02:13:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32211 states, 22368 states have (on average 1.34585121602289) internal successors, (30104), 23071 states have internal predecessors, (30104), 8010 states have call successors, (8010), 1749 states have call predecessors, (8010), 1832 states have return successors, (8761), 7864 states have call predecessors, (8761), 8001 states have call successors, (8761) [2022-07-14 02:13:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 46875 transitions. [2022-07-14 02:13:09,444 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 46875 transitions. Word has length 189 [2022-07-14 02:13:09,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:13:09,445 INFO L495 AbstractCegarLoop]: Abstraction has 32211 states and 46875 transitions. [2022-07-14 02:13:09,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 02:13:09,445 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 46875 transitions. [2022-07-14 02:13:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-14 02:13:09,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:13:09,462 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:13:09,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 02:13:09,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:13:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:13:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1620364600, now seen corresponding path program 1 times [2022-07-14 02:13:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:13:09,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571604701] [2022-07-14 02:13:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:13:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:13:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:13:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:13:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 02:13:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:13:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 02:13:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 02:13:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 02:13:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 02:13:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 02:13:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 02:13:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 02:13:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 02:13:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 02:13:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 02:13:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-14 02:13:09,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:13:09,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571604701] [2022-07-14 02:13:09,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571604701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:13:09,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:13:09,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 02:13:09,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076570236] [2022-07-14 02:13:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:13:09,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 02:13:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:13:09,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 02:13:09,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-14 02:13:09,822 INFO L87 Difference]: Start difference. First operand 32211 states and 46875 transitions. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 02:13:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:13:30,839 INFO L93 Difference]: Finished difference Result 92912 states and 143084 transitions. [2022-07-14 02:13:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 02:13:30,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 203 [2022-07-14 02:13:30,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:13:31,218 INFO L225 Difference]: With dead ends: 92912 [2022-07-14 02:13:31,219 INFO L226 Difference]: Without dead ends: 60711 [2022-07-14 02:13:31,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2022-07-14 02:13:31,357 INFO L413 NwaCegarLoop]: 2790 mSDtfsCounter, 7717 mSDsluCounter, 8271 mSDsCounter, 0 mSdLazyCounter, 12857 mSolverCounterSat, 7284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7944 SdHoareTripleChecker+Valid, 11061 SdHoareTripleChecker+Invalid, 20141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7284 IncrementalHoareTripleChecker+Valid, 12857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2022-07-14 02:13:31,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7944 Valid, 11061 Invalid, 20141 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7284 Valid, 12857 Invalid, 0 Unknown, 0 Unchecked, 16.4s Time] [2022-07-14 02:13:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60711 states. [2022-07-14 02:13:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60711 to 32211. [2022-07-14 02:13:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32211 states, 22368 states have (on average 1.34585121602289) internal successors, (30104), 23071 states have internal predecessors, (30104), 8010 states have call successors, (8010), 1749 states have call predecessors, (8010), 1832 states have return successors, (8761), 7864 states have call predecessors, (8761), 8001 states have call successors, (8761) [2022-07-14 02:13:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 46875 transitions. [2022-07-14 02:13:33,896 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 46875 transitions. Word has length 203 [2022-07-14 02:13:33,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:13:33,897 INFO L495 AbstractCegarLoop]: Abstraction has 32211 states and 46875 transitions. [2022-07-14 02:13:33,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 02:13:33,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 46875 transitions. [2022-07-14 02:13:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-14 02:13:33,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:13:33,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:13:33,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 02:13:33,917 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:13:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:13:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1718121921, now seen corresponding path program 1 times [2022-07-14 02:13:33,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:13:33,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438800238] [2022-07-14 02:13:33,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:13:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:13:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:13:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:13:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 02:13:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:13:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 02:13:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 02:13:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:13:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 02:13:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 02:13:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 02:13:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 02:13:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 02:13:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 02:13:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 02:13:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-14 02:13:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-14 02:13:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-14 02:13:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:13:34,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438800238] [2022-07-14 02:13:34,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438800238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 02:13:34,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267156454] [2022-07-14 02:13:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:13:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 02:13:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 02:13:34,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 02:13:34,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 02:13:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:35,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 2553 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 02:13:35,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 02:13:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-14 02:13:35,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 02:13:35,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267156454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:13:35,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 02:13:35,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-14 02:13:35,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041609346] [2022-07-14 02:13:35,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:13:35,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 02:13:35,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:13:35,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 02:13:35,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-14 02:13:35,260 INFO L87 Difference]: Start difference. First operand 32211 states and 46875 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 02:13:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:13:37,765 INFO L93 Difference]: Finished difference Result 71007 states and 103338 transitions. [2022-07-14 02:13:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 02:13:37,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 228 [2022-07-14 02:13:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:13:37,922 INFO L225 Difference]: With dead ends: 71007 [2022-07-14 02:13:37,922 INFO L226 Difference]: Without dead ends: 38806 [2022-07-14 02:13:38,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-14 02:13:38,009 INFO L413 NwaCegarLoop]: 2531 mSDtfsCounter, 2115 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 4372 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 02:13:38,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 4372 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 02:13:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38806 states. [2022-07-14 02:13:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38806 to 38774. [2022-07-14 02:13:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38774 states, 26982 states have (on average 1.3472685494033059) internal successors, (36352), 27807 states have internal predecessors, (36352), 9606 states have call successors, (9606), 2090 states have call predecessors, (9606), 2185 states have return successors, (10463), 9430 states have call predecessors, (10463), 9597 states have call successors, (10463) [2022-07-14 02:13:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38774 states to 38774 states and 56421 transitions. [2022-07-14 02:13:40,528 INFO L78 Accepts]: Start accepts. Automaton has 38774 states and 56421 transitions. Word has length 228 [2022-07-14 02:13:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:13:40,529 INFO L495 AbstractCegarLoop]: Abstraction has 38774 states and 56421 transitions. [2022-07-14 02:13:40,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 02:13:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 38774 states and 56421 transitions. [2022-07-14 02:13:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-07-14 02:13:40,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:13:40,555 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:13:40,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 02:13:40,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-14 02:13:40,784 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:13:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:13:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1894528937, now seen corresponding path program 1 times [2022-07-14 02:13:40,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:13:40,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910303242] [2022-07-14 02:13:40,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:13:40,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:13:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:13:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:13:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 02:13:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:13:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 02:13:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 02:13:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:13:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 02:13:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 02:13:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 02:13:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 02:13:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 02:13:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 02:13:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:13:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:13:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 02:13:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 02:13:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 02:13:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 02:13:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:13:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-14 02:13:41,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:13:41,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910303242] [2022-07-14 02:13:41,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910303242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:13:41,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:13:41,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 02:13:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720910474] [2022-07-14 02:13:41,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:13:41,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 02:13:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:13:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 02:13:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-14 02:13:41,404 INFO L87 Difference]: Start difference. First operand 38774 states and 56421 transitions. Second operand has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-14 02:14:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:14:07,868 INFO L93 Difference]: Finished difference Result 108472 states and 166707 transitions. [2022-07-14 02:14:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 02:14:07,869 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 247 [2022-07-14 02:14:07,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:14:08,295 INFO L225 Difference]: With dead ends: 108472 [2022-07-14 02:14:08,295 INFO L226 Difference]: Without dead ends: 69708 [2022-07-14 02:14:08,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 02:14:08,383 INFO L413 NwaCegarLoop]: 3265 mSDtfsCounter, 6899 mSDsluCounter, 13638 mSDsCounter, 0 mSdLazyCounter, 18145 mSolverCounterSat, 5259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7119 SdHoareTripleChecker+Valid, 16903 SdHoareTripleChecker+Invalid, 23404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5259 IncrementalHoareTripleChecker+Valid, 18145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2022-07-14 02:14:08,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7119 Valid, 16903 Invalid, 23404 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5259 Valid, 18145 Invalid, 0 Unknown, 0 Unchecked, 20.4s Time] [2022-07-14 02:14:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69708 states. [2022-07-14 02:14:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69708 to 38789. [2022-07-14 02:14:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38789 states, 26987 states have (on average 1.347204209434172) internal successors, (36357), 27807 states have internal predecessors, (36357), 9616 states have call successors, (9616), 2090 states have call predecessors, (9616), 2185 states have return successors, (10473), 9435 states have call predecessors, (10473), 9607 states have call successors, (10473) [2022-07-14 02:14:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38789 states to 38789 states and 56446 transitions. [2022-07-14 02:14:11,673 INFO L78 Accepts]: Start accepts. Automaton has 38789 states and 56446 transitions. Word has length 247 [2022-07-14 02:14:11,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:14:11,673 INFO L495 AbstractCegarLoop]: Abstraction has 38789 states and 56446 transitions. [2022-07-14 02:14:11,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-14 02:14:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 38789 states and 56446 transitions. [2022-07-14 02:14:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-07-14 02:14:11,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:14:11,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:14:11,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 02:14:11,689 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:14:11,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:14:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash -891727683, now seen corresponding path program 1 times [2022-07-14 02:14:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:14:11,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441687783] [2022-07-14 02:14:11,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:14:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:14:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:14:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:14:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:14:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-14 02:14:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:14:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 02:14:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:14:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 02:14:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:14:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 02:14:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 02:14:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 02:14:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 02:14:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 02:14:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 02:14:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 02:14:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 02:14:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 02:14:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 02:14:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-14 02:14:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-14 02:14:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-14 02:14:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:12,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 02:14:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:12,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:14:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:12,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 02:14:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:12,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-14 02:14:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:12,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 02:14:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:12,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-14 02:14:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 02:14:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-14 02:14:12,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:14:12,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441687783] [2022-07-14 02:14:12,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441687783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:14:12,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:14:12,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 02:14:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77308040] [2022-07-14 02:14:12,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:14:12,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 02:14:12,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:14:12,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 02:14:12,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 02:14:12,066 INFO L87 Difference]: Start difference. First operand 38789 states and 56446 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-14 02:14:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:14:31,144 INFO L93 Difference]: Finished difference Result 128490 states and 196599 transitions. [2022-07-14 02:14:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 02:14:31,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 259 [2022-07-14 02:14:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:14:31,720 INFO L225 Difference]: With dead ends: 128490 [2022-07-14 02:14:31,720 INFO L226 Difference]: Without dead ends: 89711 [2022-07-14 02:14:31,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-07-14 02:14:31,835 INFO L413 NwaCegarLoop]: 2152 mSDtfsCounter, 7406 mSDsluCounter, 5080 mSDsCounter, 0 mSdLazyCounter, 6709 mSolverCounterSat, 6140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7588 SdHoareTripleChecker+Valid, 7232 SdHoareTripleChecker+Invalid, 12849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6140 IncrementalHoareTripleChecker+Valid, 6709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-14 02:14:31,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7588 Valid, 7232 Invalid, 12849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6140 Valid, 6709 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-07-14 02:14:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89711 states. [2022-07-14 02:14:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89711 to 71119. [2022-07-14 02:14:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71119 states, 49609 states have (on average 1.3663448164647545) internal successors, (67783), 51431 states have internal predecessors, (67783), 17065 states have call successors, (17065), 4023 states have call predecessors, (17065), 4444 states have return successors, (21669), 16776 states have call predecessors, (21669), 17048 states have call successors, (21669) [2022-07-14 02:14:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71119 states to 71119 states and 106517 transitions. [2022-07-14 02:14:37,973 INFO L78 Accepts]: Start accepts. Automaton has 71119 states and 106517 transitions. Word has length 259 [2022-07-14 02:14:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:14:37,973 INFO L495 AbstractCegarLoop]: Abstraction has 71119 states and 106517 transitions. [2022-07-14 02:14:37,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-14 02:14:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 71119 states and 106517 transitions. [2022-07-14 02:14:38,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2022-07-14 02:14:38,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:14:38,016 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 02:14:38,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 02:14:38,017 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 02:14:38,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:14:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 886602522, now seen corresponding path program 1 times [2022-07-14 02:14:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:14:38,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282855180] [2022-07-14 02:14:38,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:14:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:14:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 02:14:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:14:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 02:14:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 02:14:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:14:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:14:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 02:14:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:14:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 02:14:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:14:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:14:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 02:14:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 02:14:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 02:14:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 02:14:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-14 02:14:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 02:14:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 02:14:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 02:14:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 02:14:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 02:14:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-14 02:14:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 02:14:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 02:14:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 02:14:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 02:14:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-14 02:14:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-14 02:14:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 02:14:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 02:14:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-14 02:14:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-14 02:14:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-14 02:14:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-14 02:14:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-14 02:14:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-14 02:14:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 02:14:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 02:14:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 02:14:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 02:14:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:14:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:14:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 02:14:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-07-14 02:14:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-14 02:14:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-07-14 02:14:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:14:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-07-14 02:14:38,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:14:38,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282855180] [2022-07-14 02:14:38,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282855180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:14:38,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:14:38,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 02:14:38,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904377639] [2022-07-14 02:14:38,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:14:38,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 02:14:38,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:14:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 02:14:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-14 02:14:38,936 INFO L87 Difference]: Start difference. First operand 71119 states and 106517 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (52), 10 states have call predecessors, (52), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-14 02:14:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:14:59,546 INFO L93 Difference]: Finished difference Result 183219 states and 290006 transitions. [2022-07-14 02:14:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 02:14:59,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (52), 10 states have call predecessors, (52), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 354 [2022-07-14 02:14:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:15:00,387 INFO L225 Difference]: With dead ends: 183219 [2022-07-14 02:15:00,387 INFO L226 Difference]: Without dead ends: 112120 [2022-07-14 02:15:00,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-07-14 02:15:00,599 INFO L413 NwaCegarLoop]: 2686 mSDtfsCounter, 3555 mSDsluCounter, 7720 mSDsCounter, 0 mSdLazyCounter, 6660 mSolverCounterSat, 2172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3911 SdHoareTripleChecker+Valid, 10406 SdHoareTripleChecker+Invalid, 8832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2172 IncrementalHoareTripleChecker+Valid, 6660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-07-14 02:15:00,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3911 Valid, 10406 Invalid, 8832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2172 Valid, 6660 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2022-07-14 02:15:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112120 states.